Rewriting-Based Techniques for Runtime Verification
Automated Software Engineering
Specifying and analyzing security automata using CSP-OZ
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Using LTL rewriting to improve the performance of model-checker based test-case generation
Proceedings of the 3rd international workshop on Advances in model-based testing
ConSpec -- A Formal Language for Policy Specification
Electronic Notes in Theoretical Computer Science (ENTCS)
Security protocols, properties, and their monitoring
Proceedings of the fourth international workshop on Software engineering for secure systems
Verified Software: Theories, Tools, Experiments
Runtime Verification of C Programs
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Run-Time Enforcement of Nonsafety Policies
ACM Transactions on Information and System Security (TISSEC)
Measuring network security using dynamic bayesian network
Proceedings of the 4th ACM workshop on Quality of protection
ConSpec – A formal language for policy specification
Science of Computer Programming
Runtime Verification
Composing expressive runtime security policies
ACM Transactions on Software Engineering and Methodology (TOSEM)
Do You Really Mean What You Actually Enforced?
Formal Aspects in Security and Trust
LTL Path Checking Is Efficiently Parallelizable
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Issues in using model checkers for test case generation
Journal of Systems and Software
On run-time enforcement of policies
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Monitoring security policies with metric first-order temporal logic
Proceedings of the 15th ACM symposium on Access control models and technologies
From MTL to deterministic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
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
Monitoring distributed systems using knowledge
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Policy monitoring in first-order temporal logic
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Enforcing different contracts in hierarchical component-based systems
SC'06 Proceedings of the 5th international conference on Software Composition
Representation-Independent data usage control
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
CoMA: conformance monitoring of java programs by abstract state machines
RV'11 Proceedings of the Second international conference on Runtime verification
Runtime verification of traces under recording uncertainty
RV'11 Proceedings of the Second international conference on Runtime verification
Security-by-contract: toward a semantics for digital signatures on mobile code
EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice
Proceedings of the 18th ACM symposium on Access control models and technologies
A Trustworthy Usage Control Enforcement Framework
International Journal of Mobile Computing and Multimedia Communications
Software health management with Bayesian networks
Innovations in Systems and Software Engineering
Execution and property specifications for JPF-android
ACM SIGSOFT Software Engineering Notes
Runtime verification of microcontroller binary code
Science of Computer Programming
| Hi-index | 0.00 |
The problem of testing whether a finite execution trace of events generated by an executing program violates a linear temporal logic (LTL) formula occurs naturally in runtime analysis of software. Two efficient algorithms for this problem are presented in this paper, both for checking safety formulae of the form “always P”, where P is a past-time LTL formula. The first algorithm is implemented by rewriting, and the second synthesizes efficient code from formulae. Further optimizations of the second algorithm are suggested, reducing space and time consumption. Special operators suitable for writing succinct specifications are discussed and shown to be equivalent to the standard past-time operators. This work is part of NASA’s PathExplorer project, the objective of which is to construct a flexible framework for efficient monitoring and analysis of program executions.