A logic for reasoning about probabilities
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Presburger arithmetic with unary predicates is P11 complete
Journal of Symbolic Logic
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Theoretical Computer Science
Introduction to distributed algorithms
Introduction to distributed algorithms
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Evolving algebras 1993: Lipari guide
Specification and validation methods
The bakery algorithm: yet another specification and verification
Specification and validation methods
Languages, automata, and logic
Handbook of formal languages, vol. 3
From formal models to formally based methods: an industrial experience
ACM Transactions on Software Engineering and Methodology (TOSEM)
Mixed real-integer linear quantifier elimination
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Inexact agreement: accuracy, precision, and graceful degradation
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Model checking
A proof of the security of quantum key distribution (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
Formal Methods in System Design
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
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Formal Methods for Real-Time Computing
Formal Methods for Real-Time Computing
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Decidable verification for reducible timed automata specified in a first order logic with time
Theoretical Computer Science
HOL Light: A Tutorial Introduction
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Mechanical Verification of a Generalized Protocol for Byzantine Fault Tolerant Clock Synchronization
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
On Verification of Refinements of Timed Distributed Algorithms
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Verification of Real-Time Systems Using PVS
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
A Logic of Probability with Decidable Model-Checking
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Decidable Classes of the Verification Problem in a Timed Predicate Logic
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract State Machines: A Method for High-Level System Design and Analysis
Understanding Protocols for Byzantine Clock Synchronization
Understanding Protocols for Byzantine Clock Synchronization
Abstract state machines capture parallel algorithms
ACM Transactions on Computational Logic (TOCL)
Systems and Software Verification: Model-Checking Techniques and Tools
Systems and Software Verification: Model-Checking Techniques and Tools
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Hi-index | 0.00 |
This paper is a survey of research of my colleagues and myself aimed at developing a comprehensive logical framework for the verification of real-time distributed systems. The framework is based on predicate logics with explicit time. To choose such a logic we pursue two goals: first, to make formalization of verification problems rather direct, without unjustified simplifications, and second, to have a logic which permits to describe decidable classes of the verifications problem covering the particular problems we are interested in. Notice that our intention is not to introduce new specification languages, but work directly with those of the user. In this paper we describe First Order Timed Logic (FOTL) that is sufficient to express the main part of verification of systems without uncertainty. The time is continuous (the formalism work as well for discrete time — in our context this case is less interesting and less efficient from algorithmic viewpoint). We give examples of problems that can be treated, describe how to represent runs of programs in FOTL, introduce decidable classes, discuss aspects of practical efficiency. We conclude with open questions.