A framework for concrete reputation-systems with applications to history-based access control
Proceedings of the 12th ACM conference on Computer and communications security
LTL Over integer periodicity constraints
Theoretical Computer Science
Foundations of incremental aspect model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
An automata-theoretic approach to constraint LTL
Information and Computation
Decidability w.r.t. Logical Consecutions of Linear Temporal Logic Extended by Since and Previous
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
A logical framework for history-based access control and reputation systems
Journal of Computer Security
XPath, transitive closure logic, and nested tree walking automata
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Mining past-time temporal rules from execution traces
WODA '08 Proceedings of the 2008 international workshop on dynamic analysis: held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2008)
A Decidable Temporal Logic of Repeating Values
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Impartial Anticipation in Runtime-Verification
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
On Regular Temporal Logics with Past,
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
Model-checking the Preservation of Temporal Properties upon Feature Integration
Electronic Notes in Theoretical Computer Science (ENTCS)
Transitive closure logic, nested tree walking automata, and XPath
Journal of the ACM (JACM)
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science
On the expressiveness of MTL variants over dense time
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Model checking freeze LTL over one-counter automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Rules admissible in transitive temporal logic TS4, sufficient condition
Theoretical Computer Science
Relentful strategic reasoning in alternating-time temporal logic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Hybrid and first-order complete extensions of CaRet
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Past time LTL runtime verification for microcontroller binary code
FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Linear temporal logic with until and before on integer numbers, deciding algorithms
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Introducing dynamic properties with past temporal operators in the b refinement
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
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
Shortest counterexamples for symbolic model checking of LTL with past
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Incremental and complete bounded model checking for full PLTL
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
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
The importance of the past in interval temporal logics: the case of propositional neighborhood logic
Logic Programs, Norms and Action
Taming past LTL and flat counter systems
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Decidability w.r.t. Logical Consecutions of Linear Temporal Logic Extended by Since and Previous
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
On the succinctness of some modal logics
Artificial Intelligence
A Trustworthy Usage Control Enforcement Framework
International Journal of Mobile Computing and Multimedia Communications
On the complexity of verifying regular properties on flat counter systems,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Runtime verification of microcontroller binary code
Science of Computer Programming
Reasoning about Data Repetitions with Counter Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL +Past (which in turn can be more succinct than LTL). We study satisfiability and model checking for NLTL and provide optimal automata-theoretic algorithms for these EXPSPACE-complete problems.