A New Approach to Proving the Correctness of Multiprocess Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
The Temporal Semantics of Concurrent Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Propositional modal logic of programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A Proof Correctness of Rem''s Semaphore Implementation of the With-When Statement
A Proof Correctness of Rem''s Semaphore Implementation of the With-When Statement
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about fair concurrent programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The complexity of reasoning about knowledge and time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Specifying message passing systems requires extending temporal logic
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
IEEE Transactions on Computers
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nonclausal deduction in first-order temporal logic
Journal of the ACM (JACM)
A decidable temporal logic to reason about many processes
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Half-order modal logic: how to prove real-time properties
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Specification and verification of active message systems
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
On the representation of infinite temporal data and queries (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hyperdocuments as automata: trace-based browsing property verification
ECHT '92 Proceedings of the ACM conference on Hypertext
Journal of the ACM (JACM)
A branching time logic with past operators
Journal of Computer and System Sciences
Verifying infinite state processes with sequential and parallel composition
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient checking of temporal integrity constraints using bounded history encoding
ACM Transactions on Database Systems (TODS)
The complexity of probabilistic verification
Journal of the ACM (JACM)
Hyperdocuments as automata: verification of trace-based browsing properties by model checking
ACM Transactions on Information Systems (TOIS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Computational Logic (TOCL)
An infinite hierarchy of temporal logics over branching time
Information and Computation
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
"Sometimes" and "not never" revisited: on branching versus linear time (preliminary report)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The temporal logic of branching time
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal resolution using a breadth-first search
Annals of Mathematics and Artificial Intelligence
Some Considerations on Branching Areas of Time
Journal of Logic, Language and Information
Combining Software and Hardware Verification Techniques
Formal Methods in System Design
LTL is expressively complete for Mazurkiewicz traces
Journal of Computer and System Sciences
Linear Temporal Logic and Finite Semigroups
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Annotated Temporal Logics Delta*tau
IBERAMIA-SBIA '00 Proceedings of the International Joint Conference, 7th Ibero-American Conference on AI: Advances in Artificial Intelligence
Dealing with Temporal Schema Anomalies in History Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
LTL Is Expressively Complete for Mazurkiewicz Traces
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Testing Hennessy-Milner Logic with Recursion
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
A Logical Characterisation of Event Recording Automata
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Implicit Temporal Query Languages: Towards Completeness
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Algorithms for Guiding Clausal Temporal Resolution
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Representing Abstract Agent Architectures
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Safety and liveness properties for real traces and a direct translation from LTL to monoids
Formal and natural computing
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation - Special issue: LICS'97
First-order logic with two variables and unary temporal logic
Information and Computation - Special issue: LICS'97
Handbook of automated reasoning
Automatically proving the correctness of compiler optimizations
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
An Until Hierarchy for Temporal Logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
The complexity of the temporal logic with "until" over general linear time
Journal of Computer and System Sciences
The power of reachability testing for timed automata
Theoretical Computer Science
The complexity of propositional linear temporal logics
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Equations between regular terms and an application to process logic
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Proving real-time properties of programs with temporal logic
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Can message buffers be characterized in linear temporal logic?
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Knowledge, common knowledge and related puzzles (Extended Summary)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Functional specification of synchronized processes based on modal logic
ICSE '82 Proceedings of the 6th international conference on Software engineering
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
An equivalence result for temporal logic
ACM SIGPLAN Notices
Future temporal logic needs infinitely many modalities
Information and Computation
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
A Suite of Tools for Debugging Distributed Autonomous Systems
Formal Methods in System Design
A modal temporal logic for reasoning about change
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Characterizing distributed systems using knowledge-based models: preliminary version
TARK '92 Proceedings of the 4th conference on Theoretical aspects of reasoning about knowledge
The synthesis of digital machines with provable epistemic properties
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
The finite and the infinite in temporal logic
ACM SIGACT News
Conditional XPath, the first order complete XPath dialect
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Encyclopedia of Computer Science
Timer formulas and decidable metric temporal logic
Information and Computation
Information and Computation
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Quasi-star-free languages on infinite words
Acta Cybernetica
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Model Checking with Strong Fairness
Formal Methods in System Design
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
Characterizing CTL-like logics on finite trees
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
BTL2 and the expressive power of ECTL+
Information and Computation
Temporal qualitative coalitional games
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Model checking restricted sets of timed paths
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Temporal Logics of Knowledge and their Applications in Security
Electronic Notes in Theoretical Computer Science (ENTCS)
Arity hierarchy for temporal logics
Theoretical Computer Science
Temporal Logic with Capacity Constraints
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
25 Years of Model Checking
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
25 Years of Model Checking
SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
25 Years of Model Checking
Comments on temporal logics for real-time system specification
ACM Computing Surveys (CSUR)
Information and Computation
A Unified Model Checking Approach with Projection Temporal Logic
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Working with the Past: Integrating History in Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Temporalization of Probabilistic Propositional Logic
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
A Labeled Natural Deduction System for a Fragment of CTL*
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
How big must complete XML query languages be?
Proceedings of the 12th International Conference on Database Theory
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Note on Non-Alethic Temporal Logics
Proceedings of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
Timer formulas and decidable metric temporal logic
Information and Computation
Information and Computation
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation
On the completeness of compositional reasoning methods
ACM Transactions on Computational Logic (TOCL)
Bounded-variable fragments of hybrid logics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Classifying discrete temporal properties
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the expressive power of QLTL
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Propositional projection temporal logic, Büchi automata and ω-regular expressions
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Pillars of computer science
Taming the complexity of temporal epistemic reasoning
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Automata-Based Axiom Pinpointing
Journal of Automated Reasoning
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
ACM Transactions on Computational Logic (TOCL)
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Temporal logics over linear time domains are in PSPACE
RP'10 Proceedings of the 4th international conference on Reachability problems
Reasoning and inference rules in basic linear temporal logic BLTL
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
A transformation from PPTL to S1S
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A formal specification and verification method for the prevention of denial of service
SP'88 Proceedings of the 1988 IEEE conference on Security and privacy
Expressiveness of propositional projection temporal logic with star
Theoretical Computer Science
The theory and practice of SALT
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Expressive Completeness for LTL With Modulo Counting and Group Quantifiers
Electronic Notes in Theoretical Computer Science (ENTCS)
Temporal logics over linear time domains are in PSPACE
Information and Computation
Natural deduction calculus for linear-time temporal logic
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Introducing attempt in a modal logic of intentional action
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Expressiveness of metric modalities for continuous time
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Reasoning about transfinite sequences
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
SALT—structured assertion language for temporal logic
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Regular linear temporal logic with past
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Simple is better: efficient bounded model checking for past LTL
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
On the expressiveness of TPTL and MTL
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
An expressive temporal logic for real time
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
From PSL to LTL: a formal validation in HOL
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
A complete temporal and spatial logic for distributed systems
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Evolution and reactivity for the web
Proceedings of the First international conference on Reasoning Web
Temporal modalities for concisely capturing timing diagrams
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Journal of Computer and System Sciences
Continuous time temporal logic with counting
Information and Computation
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
The importance of the past in interval temporal logics: the case of propositional neighborhood logic
Logic Programs, Norms and Action
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Working with the Past: Integrating History in Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
A finite basis for ‘almost future' temporal logic over the reals
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Completeness And Soundness Of Axiomatizations For Temporal Logics Without Next
Fundamenta Informaticae
Towards temporal verification of swarm robotic systems
Robotics and Autonomous Systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Linear time logics around PSL: complexity, expressiveness, and a little bit of succinctness
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A cut-free and invariant-free sequent calculus for PLTL
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
A propositional probabilistic logic with discrete linear time for reasoning about evidence
Annals of Mathematics and Artificial Intelligence
Constructive completeness for modal logic with transitive closure
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Linear temporal logic and linear dynamic logic on finite traces
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Expressive Completeness for Metric Temporal Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.02 |
The use of the temporal logic formalism for program reasoning is reviewed. Several aspects of responsiveness and fairness are analyzed, leading to the need for an additional temporal operator: the 'until' operator -U. Some general questions involving the 'until' operator are then discussed. It is shown that with the addition of this operator the temporal language becomes expressively complete. Then, two deductive systems DX and DUX are proved to be complete for the languages without and with the new operator respectively.