Executing temporal logic programs
Executing temporal logic programs
Current trends in concurrency. Overviews and tutorials
Temporal logics and their applications
Temporal logics and their applications
From a synchronous declarative language to a temporal logic dealing with multiform time
Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Models and equality for logical programming
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Temporal logic programming is complete and expressive
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specifying, programming and verifying real-time systems using a synchronous declarative language
Proceedings of the international workshop on Automatic verification methods for finite state systems
METATEM: a framework for programming in temporal logic
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Analysis of discrete event coordination
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
The L.0 Language and Environment for Protocol Simulation and Prototyping
IEEE Transactions on Computers - Special issue on protocol engineering
Programming and verifying critical systems by means of the synchronous data-flow language LUSTRE
SIGSOFT '91 Proceedings of the conference on Software for citical systems
Representing circuits more efficiently in symbolic model checking
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Model checking and abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of Theoretical Computer Science: Formal Models and Semantics
Handbook of Theoretical Computer Science: Formal Models and Semantics
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Tokio: Logic Programming Language Based on Temporal Logic and its Compilation to Prolog
Proceedings of the Third International Conference on Logic Programming
Verification in XESAR of the Sliding Window Protocol
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Issues Arising in the Analysis of L.0
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Proceedings of the Conference on Logic of Programs
Partial orderings descriptions and observations of nondeterministic concurrent processes
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
Temporal Logic in Specification
Generating efficient protocol code from an abstract specification
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
The semantics L.0, a programming language designed for the specification and simulation of protocols that assumes a true concurrency model, is given in terms of predicate linear temporal logic, and the restricted universe of models assumed in L.0 programs is defined. The execution algorithm for L.0 constructs a model in this universe. The restricted subset of temporal logic exploited permits a nonbacktracking execution algorithm. Fundamental to the semantics of L.0 is a frame assumption, which generalizes the frame assumption of standard imperative programming, and which eases specification of protocols. The data domain assumed in L.0 programs is sets of trees with labeled edges, and the state predicates permitted include existence and nonexistence predicates, as well as the more traditional assignment and equality predicates. These choices for data domain and predicates permit convenient specification of the hierarchical message structure often assumed in telecommunications protocols, for in such message structures, the existence or nonexistence of parts of the message hierarchy is determined by logical properties of the rest of the message hierarchy. A small portion of the logical layer specification of Futurebus+ is taken as the main example in this study.