Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal specification and verification of a dataflow processor array
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Embedded software verification in hardware-software codesign
Journal of Systems Architecture: the EUROMICRO Journal
Formal verification based on assume and guarantee approach — a case study (short paper)
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
JMOCHA: a model checking tool that exploits design structure
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Efficient and User-Friendly Verification
IEEE Transactions on Computers
Decomposing refinement proofs using assume-guarantee reasoning
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Assume-Guarantee Supervisor for Concurrent Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
An Assume-Guarantee Rule for Checking Simulation
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
The Formal Design of 1M-gate ASICs
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Automated Refinement Checking for Asynchronous Processes
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Automating Modular Verification
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Circular Compositional Reasoning about Liveness
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Lazy Compositional Verification
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Verification of an Implementation of Tomasulo's Algorithm by Compositional Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
You Assume, We Guarantee: Methodology and Case Studies
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Assume-Guarantee Refinement Between Different Time Scales
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Local Liveness for Compositional Modeling of Fair Reactive Systems
Proceedings of the 7th International Conference on Computer Aided Verification
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
VERTAF: An Application Framework for the Design and Verification of Embedded Real-Time Software
IEEE Transactions on Software Engineering
Computer Languages, Systems and Structures
Real-Time Embedded Software Design for Mobile and Ubiquitous Systems
Journal of Signal Processing Systems
Real-time embedded software design for mobile and ubiquitous systems
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
| Hi-index | 0.00 |
Most verification tools and methodologies such as modelchecking, equivalence checking, hardware verification, softwareverification, and hardware-software coverification oftenflatten out the behavior of a target system before verification.Inherent modularities, either explicit or implicit,functional or structural, are not exploited by these tools andalgorithms. In this work, we show how assume-guaranteereasoning (AGR) can be used for such exploitations by integratingAGR into a verification tool. Targeting at real-timeembedded systems, we propose procedures to automaticallygenerate assumptions, guarantees, and time constraints,which otherwise require manual efforts and humancreativity. Through a complex but comprehensible real-timeembedded system example such as a Vehicle Parking ManagementSystem (VPMS), we illustrate the feasibility of theAGR approach and the extremely large reduction possiblein state-space sizes when AGR is applied. Due to AGR, wealso found five errors in the VPMS design using much lesserCPU time and memory space than possible without AGR.