Adequate proof principles for invariance and liveness properties of concurrent programs
Science of Computer Programming
Fairness
Proving temporal properties of concurrent programs: a non-temporal approach
Proving temporal properties of concurrent programs: a non-temporal approach
Complementing deterministic Bu¨chi automata in polynomial time
Journal of Computer and System Sciences
Specification and verification of concurrent programs by A∀automata
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Avoiding the state explosion problem in temporal logic model checking
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A model and temporal proof system for networks of processes
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
The ``Hoare Logic'' of CSP, and All That
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
Automata, Languages, and Machines
Automata, Languages, and Machines
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
How to cook a temporal proof system for your pet language
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Verification of Concurrent Programs: Temporal Proof Principles
Logic of Programs, Workshop
Deciding Branching Time Logic: A Triple Exponential Decision Procedure for CTL*
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Proving safety and liveness of communicating processes with examples
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Transition logic: How to reason about temporal properties in a compositional way
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Now you may compose temporal logic specifications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The Collapsing Hierarchies
FOUNDATIONS OF A THEORY OF SPECIFICATION FOR DISTRIBUTED SYSTEMS
FOUNDATIONS OF A THEORY OF SPECIFICATION FOR DISTRIBUTED SYSTEMS
A hierarchy of temporal properties (invited paper, 1989)
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Formal Analysis of the Alternating Bit Protocol by Temporal Petri Nets
IEEE Transactions on Software Engineering
Multilevel specification of real time systems
Communications of the ACM - Special issue on software engineering
Compositional specification and verification of distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verification of liveness properties using compositional reachability analysis
ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
ACM Transactions on Information and System Security (TISSEC)
Classifying properties: an alternative to the safety-liveness classification
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Specification and analysis of real-time systems with PARAGON
Annals of Software Engineering
Improving the Verification of Timed Systems Using Influence Information
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Taxonomy and Catalog of Runtime Software-Fault Monitoring Tools
IEEE Transactions on Software Engineering
Verifying mutual exclusion and liveness properties with split preconditions
Journal of Computer Science and Technology
A Scenario-Matching Approach to the Description and Model Checking of Real-Time Properties
IEEE Transactions on Software Engineering
Adaptiveness in well-typed Java bytecode verification
CASCON '06 Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative research
Adapting Models to Model Checkers, A Case Study: Analysing AADL Using Time or Colored Petri Nets
RSP '09 Proceedings of the 2009 IEEE/IFIP International Symposium on Rapid System Prototyping
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
A stochastic DEVS wind turbine component model for wind farm simulation
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
On the refinement of liveness properties of distributed systems
Formal Methods in System Design
Verification of LTL on b event systems
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Vibes: A visual language for specifying behavioral requirements of algorithms
Journal of Visual Languages and Computing
| Hi-index | 0.00 |
An approach to proving temporal properties of concurrent programs that does not use temporal logic as an inference system is presented. The approach is based on using Buchi automata to specify properties. To show that a program satisfies a given property, proof obligations are derived from the Buchi automata specifying that property. These obligations are discharged by devising suitable invariant assertions and variant functions for the program. The approach is shown to be sound and relatively complete. A mutual exclusion protocol illustrates its application.