On the public citation graph
You assume, we guarantee: Methodology and case studies
0 signed · 219 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1995.1134openalex-snapshot
Forward and Backward Simulations
inferredcites →https://doi.org/10.1006/inco.1996.0060openalex-snapshot
Forward and Backward Simulations
inferredcites →https://doi.org/10.1007/3-540-16042-6_21openalex-snapshot
A proof technique for rely/guarantee properties
inferredcites →https://doi.org/10.1007/3-540-56496-9_21openalex-snapshot
Property preserving simulations
inferredcites →https://doi.org/10.1007/3-540-63166-6_6openalex-snapshot
A compositional rule for hardware design refinement
inferredcites →https://doi.org/10.1007/978-0-387-35190-2_3openalex-snapshot
Verifying Out-of-Order Executions
inferredcites →https://doi.org/10.1007/bfb0028738openalex-snapshot
Verification of an implementation of Tomasulo's algorithm by compositional model checking
inferredcites →https://doi.org/10.1007/bfb0028765openalex-snapshot
You assume, we guarantee: Methodology and case studies
inferredcites →https://doi.org/10.1007/bfb0028774openalex-snapshot
MOCHA: Modularity in model checking
inferredcites →https://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1016/0898-1221(95)90267-8openalex-snapshot
Computer-aided verification of coordinating processes: The automata-theoretic approach
inferredcites →https://doi.org/10.1145/177492.177725openalex-snapshot
Model checking and modular verification
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/69624.357207openalex-snapshot
Specifying Concurrent Program Modules
inferredcites →https://doi.org/10.1515/9781400864041openalex-snapshot
Computer-Aided Verification of Coordinating Processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/stvr.1901openalex-snapshot
A Comprehensive Formal Specification of ARINC 653 With Conformity Proof
inferred← citeshttps://doi.org/10.1007/0-306-47003-9_14openalex-snapshot
Formal Verification of Peephole Optimizations in Asynchronous Circuits
inferred← citeshttps://doi.org/10.1007/0-387-34600-7openalex-snapshot
Abstraction Refinement for Large Scale Model Checking
inferred← citeshttps://doi.org/10.1007/10722167_17openalex-snapshot
Detecting Errors Before Reaching Them
inferred← citeshttps://doi.org/10.1007/10722468_7openalex-snapshot
Bebop: A Symbolic Model Checker for Boolean Programs
inferred← citeshttps://doi.org/10.1007/11494881_10openalex-snapshot
Tracing Integration Analysis in Component-Based Formal Specifications
inferred← citeshttps://doi.org/10.1007/11513988_52openalex-snapshot
Symbolic Compositional Verification by Learning Assumptions
inferred← citeshttps://doi.org/10.1007/11691372_3openalex-snapshot
Parameterized Verification of π-Calculus Systems
inferred← citeshttps://doi.org/10.1007/11783565_3openalex-snapshot
Behavioral Compatibility Without State Explosion: Design and Verification of a Component-Based Elevator Control System
inferred← citeshttps://doi.org/10.1007/11888116_12openalex-snapshot
Automatic Synthesis of Assumptions for Compositional Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_22openalex-snapshot
Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_24openalex-snapshot
Learning Assumptions for Compositional Verification
inferred← citeshttps://doi.org/10.1007/3-540-40922-x_5openalex-snapshot
Automated Refinement Checking for Asynchronous Processes
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_15openalex-snapshot
Verifying Network Protocol Implementations by Symbolic Refinement Checking
inferred← citeshttps://doi.org/10.1007/3-540-44798-9_33openalex-snapshot
A Framework for Microprocessor Correctness Statements
inferred← citeshttps://doi.org/10.1007/3-540-45426-8_6openalex-snapshot
An Environment for the Integrated Modelling of Systems with Complex Continuous and Discrete Dynamics
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_3openalex-snapshot
A Proof of Correctness of a Processor Implementing Tomasulo’s Algorithm without a Reorder Buffer
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_13openalex-snapshot
Latency Insensitive Protocols
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_20openalex-snapshot
Assume-Guarantee Refinement between Different Time Scales
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_2openalex-snapshot
Reducing Manual Abstraction in Formal Verification of Out- of- Order Execution
inferred← citeshttps://doi.org/10.1007/978-1-4615-0351-4_10openalex-snapshot
A Practical Approach to the Formal Verification of SoC’s with Symbolic Model-Checking
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_46openalex-snapshot
Proving the Correctness of Processors with Delayed Branch Using Delayed PC
inferred← citeshttps://doi.org/10.1007/978-3-030-21759-4_7openalex-snapshot
Component-aware Input-Output Conformance
inferred← citeshttps://doi.org/10.1007/978-3-030-28619-4_18openalex-snapshot
Compositional and Contract-Based Verification for Autonomous Driving on Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-32409-4_12openalex-snapshot
Automatic Modularization of Large Programs for Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_23openalex-snapshot
AVR: Abstractly Verifying Reachability
inferred← citeshttps://doi.org/10.1007/978-3-031-21203-1_11openalex-snapshot
Assume-Guarantee Verification of Strategic Ability
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_3openalex-snapshot
Learning Assumptions for Compositional Verification of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_3openalex-snapshot
Utilising Assumptions to Determine the WCET of Multi-component Classification Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-32357-6_8openalex-snapshot
MetaMoE: Formal Verification of Compositional Robustness and Scalability of Mixture-of-Experts Architecture
inferred← citeshttps://doi.org/10.1007/978-3-319-01418-0_2openalex-snapshot
Efficient Refinement Strategy Exploiting Component Properties in a CEGAR Process
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_29openalex-snapshot
Compositional Synthesis of Concurrent Systems through Causal Model Checking and Learning
inferred← citeshttps://doi.org/10.1007/978-3-319-19249-9_3openalex-snapshot
Automated Circular Assume-Guarantee Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-41528-4_18openalex-snapshot
Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-46508-1_7openalex-snapshot
Compositional Model-Based System Design and Other Foundations for Mastering Change
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_7openalex-snapshot
Solving Language Equations Using Flanked Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_28openalex-snapshot
Compositional Model Checking with Incremental Counter-Example Construction
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_11openalex-snapshot
Analysing Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_17openalex-snapshot
Compositional Specification and Model Checking in GSTE
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_30openalex-snapshot
Modular Model Checking of Software Specifications with Simultaneous Environment Generation
inferred← citeshttps://doi.org/10.1007/978-3-540-31848-4_11openalex-snapshot
An Automata-Theoretic Approach for Model-Checking Systems with Unspecified Components
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_12openalex-snapshot
Game Models for Open Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_21openalex-snapshot
Assume-Guarantee Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-74035-3_5openalex-snapshot
A Component-Based Approach to Verification and Validation of Formal Software Models
inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_15openalex-snapshot
Assume-Guarantee Reasoning with Local Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-31759-0_7openalex-snapshot
A Compositional Minimization Approach for Large Asynchronous Design Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-37395-4_3openalex-snapshot
Towards Agile Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-58322-3_24openalex-snapshot
Proving the Correctness of a Complete Microprocessor
inferred← citeshttps://doi.org/10.1007/bfb0028737openalex-snapshot
Formal verification of out-of-order execution using incremental flushing
inferred← citeshttps://doi.org/10.1007/bfb0028774openalex-snapshot
MOCHA: Modularity in model checking
inferred← citeshttps://doi.org/10.1007/s00165-017-0436-0openalex-snapshot
Automated circular assume-guarantee reasoning
inferred← citeshttps://doi.org/10.1007/s00766-013-0198-zopenalex-snapshot
On requirement verification for evolving Statecharts specifications
inferred← citeshttps://doi.org/10.1007/s10009-002-0087-0openalex-snapshot
A framework for superscalar microprocessor correctness statements
inferred← citeshttps://doi.org/10.1007/s10009-006-0007-9openalex-snapshot
CTL-property Transformations along an Incremental Design Process
inferred← citeshttps://doi.org/10.1007/s10009-013-0271-4openalex-snapshot
Rigorous embedded design: challenges and perspectives
inferred← citeshttps://doi.org/10.1007/s10270-014-0410-8openalex-snapshot
Component-based verification using incremental design and invariants
inferred← citeshttps://doi.org/10.1007/s10270-025-01281-6openalex-snapshot
Model checking of spacecraft operational designs: a scalability analysis
inferred← citeshttps://doi.org/10.1007/s10703-008-0055-8openalex-snapshot
Automatic symbolic compositional verification by learning assumptions
inferred← citeshttps://doi.org/10.1007/s10703-025-00484-3openalex-snapshot
Automatic assume-guarantee reasoning for safety and liveness using passive learning
inferred← citeshttps://doi.org/10.1007/s11265-015-0971-yopenalex-snapshot
Tokens vs. Signals: On Conformance between Formal Models of Dataflow and Hardware
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.06.021openalex-snapshot
Compositional synthesis of finite abstractions for networks of systems: A small-gain approach
inferred← citeshttps://doi.org/10.1016/j.conengprac.2015.05.006openalex-snapshot
Synthesizing safe control-command systems out of reusable components
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104819openalex-snapshot
The refinement calculus of reactive systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2020.12.2356openalex-snapshot
Compositional Synthesis of Symbolic Models for Infinite Networks
inferred← citeshttps://doi.org/10.1016/j.jss.2005.11.570openalex-snapshot
Automatic generation of assumptions for modular verification of software specifications
inferred← citeshttps://doi.org/10.1016/j.nahs.2020.100880openalex-snapshot
Compositional abstraction of large-scale stochastic systems: A relaxed dissipativity approach
inferred← citeshttps://doi.org/10.1016/j.nahs.2021.101097openalex-snapshot
Symbolic models for infinite networks of control systems: A compositional approach
inferred← citeshttps://doi.org/10.1016/j.nahs.2022.101173openalex-snapshot
Compositional construction of abstractions for infinite networks of discrete-time switched systems
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102439openalex-snapshot
A framework for assume-guarantee regression verification of evolving software
inferred← citeshttps://doi.org/10.1016/j.sysconle.2010.08.002openalex-snapshot
Compositional analysis for linear systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.016openalex-snapshot
Compositional analysis for verification of parameterized systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)30760-7openalex-snapshot
Validating fault-tolerant behaviors of synchronous system specifications by discrete controller synthesis
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)37216-6openalex-snapshot
A Survey of Verification Techniques for Solving the State Explosion Problem
inferred← citeshttps://doi.org/10.1023/a:1008734703554openalex-snapshot
Analysis of Timed Systems Using Time-Abstracting Bisimulations
inferred← citeshttps://doi.org/10.1023/a:1014118529369openalex-snapshot
Formal Verification of Out-of-Order Execution with Incremental Flushing
inferred← citeshttps://doi.org/10.1023/a:1014122630277openalex-snapshot
Verification of FM9801: An Out-of-Order Microprocessor Model with Speculative Execution, Exceptions, and Program-Modifying Capability
inferred← citeshttps://doi.org/10.1049/iet-cdt.2016.0189openalex-snapshot
Formal verification methodology for real‐time Field Programmable Gate Array
inferred← citeshttps://doi.org/10.1109/43.945302openalex-snapshot
Theory of latency-insensitive design
inferred← citeshttps://doi.org/10.1109/acc.2016.7526535openalex-snapshot
Counterexample-guided distributed permissive supervisor synthesis for probabilistic multi-agent systems through learning
inferred← citeshttps://doi.org/10.1109/acsd.2015.19openalex-snapshot
When Do We (Not) Need Complex Assume-Guarantee Rules?
inferred← citeshttps://doi.org/10.1109/aero.2006.1656029openalex-snapshot
Verification of Autonomous Systems for Space Applications
inferred← citeshttps://doi.org/10.1109/apsec.2007.33openalex-snapshot
Compositional Verification of UML Dynamic Models
inferred← citeshttps://doi.org/10.1109/ase.2004.1342779openalex-snapshot
Decompositional veri .cation of component-based systems - a hybrid approach
inferred← citeshttps://doi.org/10.1109/ase.2004.32openalex-snapshot
Decompositional verification of component-based systems-a hybrid approach
inferred← citeshttps://doi.org/10.1109/ase.2015.33openalex-snapshot
Interpolation Guided Compositional Verification (T)
inferred← citeshttps://doi.org/10.1109/aspdac.2000.835074openalex-snapshot
Formal verification based on assume and guarantee approach: a case study
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466227openalex-snapshot
Automatic assume guarantee analysis for assertion-based formal verification
inferred← citeshttps://doi.org/10.1109/async.2010.25openalex-snapshot
Formal Verification of an Arbiter Circuit
inferred← citeshttps://doi.org/10.1109/ats.2015.42openalex-snapshot
A New Approach for Minimal Environment Construction for Modular Property Verification
inferred← citeshttps://doi.org/10.1109/cacsd.1999.808632openalex-snapshot
Modular verification of a fault-tolerant active structure controller: an example
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798365openalex-snapshot
Assume-guarantee reasoning framework for MDP-POMDP
inferred← citeshttps://doi.org/10.1109/csf.2011.22openalex-snapshot
Assumptions and Guarantees for Compositional Noninterference
inferred← citeshttps://doi.org/10.1109/dasc66011.2025.11257175openalex-snapshot
Modeling and Formal Analysis of High-Assurance Mixed-Reality Systems
inferred← citeshttps://doi.org/10.1109/date.2002.998246openalex-snapshot
Using rewriting rules and positive equality to formally verify wide-issue out-of-order microprocessors with a reorder buffer
inferred← citeshttps://doi.org/10.1109/date.2004.1268871openalex-snapshot
Microarchitecture development via metropolis successive platform refinement
inferred← citeshttps://doi.org/10.1109/emsoft.2013.6658591openalex-snapshot
On composing and proving the correctness of reactive behavior
inferred← citeshttps://doi.org/10.1109/eurmic.2001.952462openalex-snapshot
Case study: Formal specification and verification of railway interlocking system
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.11openalex-snapshot
Verifying an Arbiter Circuit
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351134openalex-snapshot
Data mining based decomposition for assume-guarantee reasoning
inferred← citeshttps://doi.org/10.1109/hase.2001.966818openalex-snapshot
On simplifying modular specification and verification of distributed protocols
inferred← citeshttps://doi.org/10.1109/hldvt.2004.1431231openalex-snapshot
Formal verification of pipelined processors with load-value prediction
inferred← citeshttps://doi.org/10.1109/hldvt.2009.5340165openalex-snapshot
A coordinated reachability analysis method for modular verification of asynchronous designs
inferred← citeshttps://doi.org/10.1109/hldvt.2010.5496663openalex-snapshot
An improvement in decomposed reachability analysis for symbolic model checking
inferred← citeshttps://doi.org/10.1109/hldvt.2010.5496666openalex-snapshot
State space reductions for scalable verification of asynchronous designs
inferred← citeshttps://doi.org/10.1109/host55342.2024.10545349openalex-snapshot
Verifying Memory Confidentiality and Integrity of Intel TDX Trusted Execution Environments
inferred← citeshttps://doi.org/10.1109/icasic.2001.982489openalex-snapshot
Design verification using formal techniques
inferred← citeshttps://doi.org/10.1109/icasic.2003.1277543openalex-snapshot
Compositional verification: an industrial case study
inferred← citeshttps://doi.org/10.1109/iccad.1999.810700openalex-snapshot
Formal specification and verification of a dataflow processor array
inferred← citeshttps://doi.org/10.1109/iccad.2000.896481openalex-snapshot
Decomposing refinement proofs using assume-guarantee reasoning
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323681openalex-snapshot
LFPS: Learned Formal Proof Strengthening for Efficient Hardware Verification
inferred← citeshttps://doi.org/10.1109/iccd.2003.1240869openalex-snapshot
Verification of timed circuits with failure directed abstractions
inferred← citeshttps://doi.org/10.1109/icnp55882.2022.9940333openalex-snapshot
Kirigami, the Verifiable Art of Network Cutting
inferred← citeshttps://doi.org/10.1109/icse.2001.919196openalex-snapshot
jMocha: a model checking tool that exploits design structure
inferred← citeshttps://doi.org/10.1109/icsse70735.2026.11718736openalex-snapshot
AutoFV: A Framework for Rapid Formal Verification Bring-Up
inferred← citeshttps://doi.org/10.1109/icvd.2003.1183145openalex-snapshot
Automating formal modular verification of asynchronous real-time embedded systems
inferred← citeshttps://doi.org/10.1109/ised.2014.8openalex-snapshot
Safe IP Integration Using Container Modules
inferred← citeshttps://doi.org/10.1109/isic.2001.971500openalex-snapshot
Verification of hybrid controlled processing systems based on decomposition and deduction
inferred← citeshttps://doi.org/10.1109/isorc.2014.42openalex-snapshot
Programming Paradigms for Real-Time Systems
inferred← citeshttps://doi.org/10.1109/isqed.2006.142openalex-snapshot
Using Abstraction for Efficient Formal Verification of Pipelined Processors with Value Prediction
inferred← citeshttps://doi.org/10.1109/isvlsi.2009.16openalex-snapshot
Synchronization-Based Abstraction Refinement for Modular Verification of Asynchronous Designs
inferred← citeshttps://doi.org/10.1109/iwsoc.2003.1213066openalex-snapshot
Symbolic simulation as a simplifying strategy for SoC verification
inferred← citeshttps://doi.org/10.1109/jproc.2004.831197openalex-snapshot
Formal verification of timed systems: a survey and perspective
inferred← citeshttps://doi.org/10.1109/jproc.2018.2834926openalex-snapshot
Layering Assume-Guarantee Contracts for Hierarchical System Design
inferred← citeshttps://doi.org/10.1109/lcsys.2019.2920766openalex-snapshot
Compositional Synthesis of Symbolic Models for Networks of Switched Systems
inferred← citeshttps://doi.org/10.1109/models58315.2023.00011openalex-snapshot
Applicability of Model Checking for Verifying Spacecraft Operational Designs
inferred← citeshttps://doi.org/10.1109/prdc.2006.16openalex-snapshot
A Strategy for Verification of Decomposable SCR Models
inferred← citeshttps://doi.org/10.1109/re.2013.6636706openalex-snapshot
On requirements verification for model refinements
inferred← citeshttps://doi.org/10.1109/repa.2011.6046720openalex-snapshot
Exactly the information your subcontractor needs: DeSyRe — Decomposing system requirements
inferred← citeshttps://doi.org/10.1109/rsp.2006.19openalex-snapshot
Formalizing the Incremental Design and Verification Process of a Pipelined Protocol Converter
inferred← citeshttps://doi.org/10.1109/sefm.2003.1236214openalex-snapshot
Component-based design and analysis: a case study
inferred← citeshttps://doi.org/10.1109/srds55811.2022.00018openalex-snapshot
Compositional Model Checking of Consensus Protocols via Interaction-Preserving Abstraction
inferred← citeshttps://doi.org/10.1109/tac.2017.2753039openalex-snapshot
Compositional Abstraction and Safety Synthesis Using Overlapping Symbolic Models
inferred← citeshttps://doi.org/10.1109/tac.2018.2879505openalex-snapshot
Permissive Supervisor Synthesis for Markov Decision Processes Through Learning
inferred← citeshttps://doi.org/10.1109/tc.2009.187openalex-snapshot
Modular Model Checking of Large Asynchronous Designs with Efficient Abstraction Refinement
inferred← citeshttps://doi.org/10.1109/tc.2010.94openalex-snapshot
Counterexample-Guided Assume-Guarantee Synthesis through Learning
inferred← citeshttps://doi.org/10.1109/tc.2014.2329701openalex-snapshot
Compositional Model Checking of Concurrent Systems
inferred← citeshttps://doi.org/10.1109/tcad.2005.854638openalex-snapshot
Verification of timed circuits with failure-directed abstractions
inferred← citeshttps://doi.org/10.1109/tcad.2009.2012531openalex-snapshot
Automated Interface Refinement for Compositional Verification
inferred← citeshttps://doi.org/10.1109/tcad.2009.2035544openalex-snapshot
Compositional Reachability Analysis for Efficient Modular Verification of Asynchronous Designs
inferred← citeshttps://doi.org/10.1109/te.2004.832880openalex-snapshot
Integrating Formal Verification into an Advanced Computer Architecture Course
inferred← citeshttps://doi.org/10.1109/tnet.2024.3360371openalex-snapshot
Kirigami, the Verifiable Art of Network Cutting
inferred← citeshttps://doi.org/10.1109/tse.2013.57openalex-snapshot
Learning Assumptions for CompositionalVerification of Timed Systems
inferred← citeshttps://doi.org/10.1109/tse.2021.3101818openalex-snapshot
Combining Genetic Programming and Model Checking to Generate Environment Assumptions
inferred← citeshttps://doi.org/10.1142/s0129054113500123openalex-snapshot
ASSUME-GUARANTEE REASONING WITH LOCAL SPECIFICATIONS
inferred← citeshttps://doi.org/10.1145/1069774.1069794openalex-snapshot
A compositional semantics for CHR
inferred← citeshttps://doi.org/10.1145/1101908.1101974openalex-snapshot
Compositional reasoning for port-based distributed systems
inferred← citeshttps://doi.org/10.1145/1120725.1120963openalex-snapshot
Automatic assume guarantee analysis for assertion-based formal verification
inferred← citeshttps://doi.org/10.1145/1122971.1122992openalex-snapshot
Proving correctness of highly-concurrent linearisable objects
inferred← citeshttps://doi.org/10.1145/1394496.1394499openalex-snapshot
Enforcing behavioral constraints in evolving aspect-oriented programs
inferred← citeshttps://doi.org/10.1145/1457255.1457258openalex-snapshot
Throughput-driven synthesis of embedded software for pipelined execution on multicore architectures
inferred← citeshttps://doi.org/10.1145/1462179.1462183openalex-snapshot
A compositional semantics for CHR
inferred← citeshttps://doi.org/10.1145/1755952.1755957openalex-snapshot
Compositional analysis for linear control systems
inferred← citeshttps://doi.org/10.1145/1985342.1985345openalex-snapshot
A Theory of Synchronous Relational Interfaces
inferred← citeshttps://doi.org/10.1145/2039370.2039382openalex-snapshot
Correct and non-defensive glue design using abstract models
inferred← citeshttps://doi.org/10.1145/2632362.2632366openalex-snapshot
Local state space construction for compositional verification of concurrent systems
inferred← citeshttps://doi.org/10.1145/2771783.2771794openalex-snapshot
Reliability assessment for distributed systems via communication abstraction and refinement
inferred← citeshttps://doi.org/10.1145/3012280openalex-snapshot
When Do We Not Need Complex Assume-Guarantee Rules?
inferred← citeshttps://doi.org/10.1145/3055004.3055011openalex-snapshot
Formal synthesis of distributed optimal traffic control policies
inferred← citeshttps://doi.org/10.1145/325694.325746openalex-snapshot
Modular refinement of hierarchic reactive machines
inferred← citeshttps://doi.org/10.1145/3368089.3409737openalex-snapshot
Mining assumptions for software components using machine learning
inferred← citeshttps://doi.org/10.1145/3591222openalex-snapshot
Modular Control Plane Verification via Temporal Invariants
inferred← citeshttps://doi.org/10.1145/3629145openalex-snapshot
Modular Data Plane Verification for Compositional Networks
inferred← citeshttps://doi.org/10.1145/3638246openalex-snapshot
Test Generation Strategies for Building Failure Models and Explaining Spurious Failures
inferred← citeshttps://doi.org/10.1145/368434.368530openalex-snapshot
Formal verification based on assume and guarantee approach --- a case study (short paper)
inferred← citeshttps://doi.org/10.1145/973097.973101openalex-snapshot
Modular refinement of hierarchic reactive machines
inferred← citeshttps://doi.org/10.1186/1752-0509-1-4openalex-snapshot
Qualitative networks: a symbolic approach to analyze biological signaling networks
inferred← citeshttps://doi.org/10.1504/ijes.2005.008815openalex-snapshot
TLSim and EVC: a term-level symbolic simulator and an efficient decision procedure for the logic of equality with uninterpreted functions and memories
inferred← citeshttps://doi.org/10.1587/transinf.2018fop0004openalex-snapshot
On Locally Minimum and Strongest Assumption Generation Method for Component-Based Software Verification
inferred← citeshttps://doi.org/10.1609/aaai.v38i19.30116openalex-snapshot
Assume-Guarantee Reinforcement Learning
inferred← citeshttps://doi.org/10.18260/1-2--11927openalex-snapshot
Integrating Formal Verification Into An Advanced Computer Architecture Course
inferred← citeshttps://doi.org/10.22028/d291-25787openalex-snapshot
A lattice-theoretic framework for circular assume-guarantee reasoning
inferred← citeshttps://doi.org/10.23919/acc.2017.7963006openalex-snapshot
Compositional abstraction refinement for control synthesis under lasso-shaped specifications
inferred← citeshttps://doi.org/10.23919/acc.2019.8815361openalex-snapshot
Compositional synthesis of almost maximally permissible safety controllers
inferred← citeshttps://doi.org/10.23919/ecc.2009.7075195openalex-snapshot
Assume-guarantee reasoning for linear dynamical systems
inferred← citeshttps://doi.org/10.23919/ecc.2019.8796176openalex-snapshot
Compositional Abstractions of Interconnected Discrete-Time Switched Systems
inferred← citeshttps://doi.org/10.25916/sut.26292130openalex-snapshot
Modular consistency analysis of component-based designs
inferred← citeshttps://doi.org/10.3182/20020721-6-es-1901.00566openalex-snapshot
MODULAR ANALYSIS OF DISCRETE CONTROLLERS FOR DISTRIBUTED HYBRID SYSTEMS
inferred← citeshttps://doi.org/10.33915/etd.2495openalex-snapshot
A component-based approach to verification and validation of formal software models
inferred← citeshttps://doi.org/10.36001/phmconf.2014.v6i1.2389openalex-snapshot
Formal Verification of Complex Systems based on SysML Functional Requirements
inferred← citeshttps://doi.org/10.48456/tr-726openalex-snapshot
Modular fine-grained concurrency verification
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0404037openalex-snapshot
Model-checking Driven Black-box Testing Algorithms for Systems with Unspecified Components
inferred← citeshttps://doi.org/10.5445/ir/1000039446openalex-snapshot
Towards Specification and Verification of Information Flow in Concurrent Java-like Programs
inferred← citeshttps://doi.org/10.5555/1838206.1838296openalex-snapshot
CTL.STIT: enhancing ATL to express important multi-agent system verification properties
inferred← citeshttps://doi.org/10.5555/339492.339554openalex-snapshot
Marsh: min-area retiming with setup and hold constraints
inferred← citeshttps://doi.org/10.5555/339492.340066openalex-snapshot
Formal specification and verification of a dataflow processor array
inferred← citeshttps://doi.org/10.5555/381473.381748openalex-snapshot
JMOCHA: a model checking tool that exploits design structure
inferred← citeshttps://doi.org/10.5555/602902.602958openalex-snapshot
Decomposing refinement proofs using assume-guarantee reasoning
inferred← citeshttps://doi.org/10.5555/882452.874524openalex-snapshot
Using Rewriting Rules and Positive Equality to Formally Verify Wide-Issue Out-of-Order Microprocessors with a Reorder Buffer
inferred← citeshttps://doi.org/10.70675/9ab2f639zef32z4dbczb556z36ca6c30d317openalex-snapshot
Automated verification and synthesis of distributed systems : in particular applied to SDN-IoT platform
inferred← citeshttps://doi.org/10.70675/9c7332d9zaae2z4513z962czd7ecf1549a97openalex-snapshot
Compositional and Efficient Controller Synthesis for Cyber-Physical Systems
inferred← citeshttps://doi.org/10.70675/a05a7113z5044z4d7cz92ebze85a9e5b4ec9openalex-snapshot
Invariance and symbolic control of cooperative systems for temperature regulation in intelligent buildings
inferred← citeshttps://doi.org/10.70675/dde63549z5bdfz45c6z81f0zdf1501b78d45openalex-snapshot
Conception sûre de systèmes embarqués à base de COTS
showing the first 199 of 200 · page through all 200
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.