Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Algorithmic Verification of Linear Temporal Logic Specifications
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A compositional approach to CTL* verification
Theoretical Computer Science - Formal methods for components and objects
Efficient monitoring of ω-languages
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Security protocols, properties, and their monitoring
Proceedings of the fourth international workshop on Software engineering for secure systems
On the Merits of Temporal Testers
25 Years of Model Checking
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
On Regular Temporal Logics with Past,
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Model checking PSL using HOL and SMV
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
Syntactic optimizations for PSL verification
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Boolean abstraction for temporal logic satisfiability
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Efficient and expressive tree filters
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
The good, the bad, and the ugly, but how ugly is ugly?
RV'07 Proceedings of the 7th international conference on Runtime verification
Making prophecies with decision predicates
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
You should better enforce than verify
RV'10 Proceedings of the First international conference on Runtime verification
Runtime Verification for LTL and TLTL
ACM Transactions on Software Engineering and Methodology (TOSEM)
Sampling-based runtime verification
FM'11 Proceedings of the 17th international conference on Formal methods
When the requirements for adaptation and high integrity meet
Proceedings of the 8th workshop on Assurances for self-adaptive systems
Monitorability of stochastic dynamical systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Regular linear temporal logic with past
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Proving the refuted: symbolic model checkers as proof generators
Concurrency, Compositionality, and Correctness
An asymptotically correct finite path semantics for LTL
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Self-adaptive software needs quantitative verification at runtime
Communications of the ACM
Efficient techniques for near-optimal instrumentation in time-triggered runtime verification
RV'11 Proceedings of the Second international conference on Runtime verification
Runtime verification: the application perspective
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Towards certified runtime verification
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Reasoning about nondeterminism in programs
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
A formal data-centric approach for passive testing of communication protocols
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.02 |
The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temporal testers can be viewed as (non-deterministic) transducers that, at any point, output a boolean value which is 1 iff the corresponding temporal formula holds starting at the current position. The main advantage of testers, compared to acceptors (such as Büchi automata) is that they are compositional. Namely, a tester for a compound formula can be constructed out of the testers for its sub-formulas. In this paper, we extend the application of the testers method from LTL to the logic PSL. Besides providing the construction of testers for PSL, we indicate how the symbolic representation of the testers can be directly utilized for efficient model checking and run-time monitoring