Elective temporal logic
Pages 143 - 152
Abstract
In this paper we present a novel formalism for defining properties over linear execution traces, namely elective temporal logic (ETL). Differently from several other temporal logics, ETL is not dedicated to a specific time model, e.g. discrete time or real time. Hence, properties can be applied to each temporal context with no changes to the specified formulas. Moreover, the ETL denotational semantics is given through elective functions. In this way we map formulas into the characteristic functions of a set of accepted traces, i.e. the valid executions.
A further contribution of this work is an application of ETL to runtime monitoring. As a matter of fact, using a security monitor driven by an ETL formula, we can ignore irrelevant security actions performed by the guarded program reducing the monitor workload.
References
[1]
Rajeev Alur. Timed automata. In Proceedings of the 11th International Conference on Computer Aided Verification, CAV '99, pages 8--22, July 1999.
[2]
Rajeev Alur, Tomás Feder, and Thomas A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43:116--146, January 1996.
[3]
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari, and Roberto Zunino. Model checking usage policies. In Christos Kaklamanis and Flemming Nielson, editors, Trustworthy Global Computing, pages 19--35. Springer-Verlag, 2009.
[4]
Andreas Bauer, Martin Leucker, and Christian Schallhart. Monitoring of real-time properties. In S. Arun-Kumar and Naveen Garg, editors, FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, volume 4337 of Lecture Notes in Computer Science, pages 260--272. Springer Berlin / Heidelberg, 2006.
[5]
Schallhart. Runtime Verfication for LTL and TLTL. Technical Report TUM-I0724, Institut für Informatik, Technische Universität München, 2007.
[6]
George Boole. The calculus of logic. The Cambridge and Dublin Mathematical Journal, 3, 1848.
[7]
A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new symbolic model verifier. In Proceedings of the 11th International Conference on Computer Aided Verification, CAV '99, pages 495--499, July 1999.
[8]
Gabriele Costa, Fabio Martinelli, Paolo Mori, Christian Schaefer, and Thomas Walter. Runtime monitoring for next generation Java ME platform. Computers & Security, July 2009.
[9]
Lieven Desmet, Wouter Joosen, Fabio Massacci, Katsiaryna Naliuka, Pieter Philippaerts, Frank Piessens, and Dries Vanoverberghe. The S3MS .NET run time monitor: Tool demonstration. Electronic Notes in Theoretical Computer Science, 253(5):153--159, 2009.
[10]
Gerard Holzmann. Spin model checker, the: primer and reference manual. Addison-Wesley Professional, first edition, 2003.
[11]
Dexter Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333--354, 1983.
[12]
Fabio Martinelli and Ilaria Matteucci. Through modelling to synthesis of security automata. Electronic Notes in Theoretical Computer Science, 179:31--46, July 2007.
[13]
Riku Mettala. Bluetooth Protocol Architecture (Version 1.0). Nokia Mobile Phones, September 1999.
[14]
George C. Necula. Proof-carrying code. In Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL '97, pages 106--119, 1997.
[15]
Amir Pnueli. The temporal logic of programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 46--57, November 1977.
Recommendations
Constructive linear-time temporal logic: Proof systems and Kripke semantics
In this paper we study a version of constructive linear-time temporal logic (LTL) with the ''next'' temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time ...
A Paraconsistent Linear-time Temporal Logic
Inconsistency-tolerant reasoning and paraconsistent logic are of growing importance not only in Knowledge Representation, AI and other areas of Computer Science, but also in Philosophical Logic. In this paper, a new logic, paraconsistent linear-time ...
A Tableau Calculus for a Temporal Logic with Temporal Connectives
TABLEAUX '99: Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related MethodsThe paper presents a tableau calculus for a linear time temporal logic for reasoning about processes and events in concurrent systems. The logic is based on temporal connectives in the style of Transaction Logic [BK94] and explicit quantification over ...
Comments
Information & Contributors
Information
Published In
June 2011
206 pages
ISBN:9781450307246
DOI:10.1145/2000259
- General Chairs:
- Ivica Crnkovic,
- Judith A. Stafford,
- Program Chairs:
- Dorina Petriu,
- Jens Happe,
- Paola Inverardi
Copyright © 2011 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 June 2011
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Comparch '11
Sponsor:
Comparch '11: Federated Events on Component-Based Software Engineering and Software Architecture
June 20 - 24, 2011
Colorado, Boulder, USA
Acceptance Rates
Overall Acceptance Rate 46 of 131 submissions, 35%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 61Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in