63 Hits in 4.6 sec

Generating Optimal Linear Temporal Logic Monitors by Coinduction [chapter]

Koushik Sen, Grigore Roşu, Gul Agha
2003 Lecture Notes in Computer Science  
A coinduction-based technique to generate an optimal monitor from a Linear Temporal Logic (LTL) formula is presented in this paper.  ...  The MaC tool by Lee et al. [14, 17] has been developed to monitor safety properties in interval past time temporal logic.  ...  Acknowledgements The work is supported in part by the Defense Advanced Research Projects Agency (the DARPA IPTO TASK Program, contract number F30602-00-2-0586, the DARPA IXO NEST Program, contract number  ... 
doi:10.1007/978-3-540-40965-6_17 fatcat:dhcfvwx3bffcjnimqwlplznzpe

Generating Optimal Monitors for Extended Regular Expressions

Koushik Sen, Grigore Roşu
2003 Electronical Notes in Theoretical Computer Science  
In this paper we present a technique to generate optimal monitors from EREs.  ...  Our monitors are deterministic finite automata (DFA) and our novel contribution is to generate them using a modern coalgebraic technique called coinduction.  ...  As future work, it seems interesting to investigate the size of minimal DFAs generated from EREs, and also to apply our coinductive techniques to generate monitors for other logics, such as temporal logics  ... 
doi:10.1016/s1571-0661(04)81051-x fatcat:sc53o4iffbdzjnr4vuwzal4hge

ActionScript bytecode verification with co-logic programming

Brian W. DeVries, Gopal Gupta, Kevin W. Hamlen, Scott Moore, Meera Sridhar
2009 Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security - PLAS '09  
This results in an unusually small trusted computing base, making the verification system well-suited to frameworks like certifying in-lined reference monitoring systems, which require small, light-weight  ...  A prototype security policy verification system for Action-Script binaries is presented, whose implementation leverages recent advances in co-logic programming.  ...  Our verifier expresses security policies using Linear Temporal Logic (LTL) [23] , which extends propositional logic with temporal operators.  ... 
doi:10.1145/1554339.1554342 dblp:conf/pldi/DeVriesGHMS09 fatcat:gkclucx7hvesnkev32kkcc64pe

Towards Monitoring-Oriented Programming

Feng Chen, Grigore Roşu
2003 Electronical Notes in Theoretical Computer Science  
A prototype has been implemented for Java, which currently supports requirements expressed using past time and future time linear temporal logics, as well as extended regular expressions.  ...  Efficient monitoring code using the same target language as the implementation is then automatically generated during a precompilation stage.  ...  Past Time Linear Temporal Logic Past time linear temporal logic (ptLTL) formulae are routinely used to express safety requirements.  ... 
doi:10.1016/s1571-0661(04)81045-4 fatcat:b2ter52jvjhljccny2ggzh4gxu

An LTL Proof System for Runtime Verification [chapter]

Clare Cini, Adrian Francalanza
2015 Lecture Notes in Computer Science  
We also prove decidability and incrementality properties for a monitoring algorithm constructed from it. Finally, we relate its expressivity to existing symbolic analysis techniques used in RV.  ...  propose a local proof system for LTL formalising deductions within the constraints of Runtime Verification (RV), and show how such a system can be used as a basis for the construction of online runtime monitors  ...  In [SRA04] , coinductive deductive techniques are used on derivatives to establish LTL formula equivalences, which are then used to obtain optimal monitors for good/bad prefixes. Example 10.  ... 
doi:10.1007/978-3-662-46681-0_54 fatcat:uhn37e3y5rfcrggxform6eccgm

Rast: A Language for Resource-Aware Session Types [article]

Ankush Das, Frank Pfenning
2022 arXiv   pre-print
In response, recent work has extended session types with refinements from linear arithmetic, capturing intrinsic attributes of processes and data.  ...  To further support generic programming, Rast also enhances arithmetically refined session types with recently developed nested parametric polymorphism.  ...  Recent work has placed binary session types without general recursion on a strong logical foundation by exhibiting a Curry-Howard isomorphism with linear logic [CP10, Wad12, CPT16] .  ... 
arXiv:2012.13129v3 fatcat:fet77q4la5gptbycrnsaet5abi

Maximal Synthesis for Hennessy-Milner Logic with the Box Modality

A.C. van Hulst, M.A. Reniers, W.J. Fokkink
2014 IFAC Proceedings Volumes  
This research extends earlier work by embracing a broader synthesized logic, enabling synthesis with respect to invariant formulas for non-deterministic behavioral models.  ...  This paper presents a novel approach to adapt a behavioral model in order to satisfy a requirement in Hennessy-Milner Logic, including an additional box modality operator, expressing an invariant formula  ...  ACKNOWLEDGEMENTS This work is supported by the EU FP7 Programme under grant agreement no. 295261 (MEALS)  ... 
doi:10.3182/20140514-3-fr-4046.00034 fatcat:nx34foebprc7vhq27q5phrquee

AppLP: A Dialogue on Applications of Logic Programming [article]

David S. Warren, Yanhong A. Liu
2017 arXiv   pre-print
This document describes the contributions of the 2016 Applications of Logic Programming Workshop (AppLP), which was held on October 17 and associated with the International Conference on Logic Programming  ...  requires monitoring the system over time.  ...  Logic programming can also be used to build a model checker for logics with temporal properties, as exemplified with Computational Tree Logic (CTL).  ... 
arXiv:1704.02375v1 fatcat:eai5tuldkvez3makttxz23goby

Dynamic Program Analysis [chapter]

Alex Biryukov, Christophe De Cannière, William E. Winkler, Charu C. Aggarwal, Markus Kuhn, Luc Bouganim, Yanli Guo, Bart Preneel, Gerrit Bleumer, Tor Helleseth, Ran Canetti, Mayank Varia (+35 others)
2011 Encyclopedia of Cryptography and Security  
This combined method provides the first technique to v research on runtime monitoring.  ...  The methods are based on three new techniques: concolic testing, race-detection and flipping, and predictive monitoring.  ...  For example, [88, 89] show coinductive techniques to generate minimal static monitors from EREs and from future time linear temporal logics, respectively, and [50, 13] show how to generate dynamic  ... 
doi:10.1007/978-1-4419-5906-5_1352 fatcat:6xfnq4jmxnefphktsrcesjgzdu

Copilot: A Hard Real-Time Runtime Monitor [chapter]

Lee Pike, Alwyn Goodloe, Robin Morisset, Sebastian Niller
2010 Lecture Notes in Computer Science  
Copilot is a stream-based dataflow language that generates small constant-time and constant-space C programs, implementing embedded monitors.  ...  Copilot also generates its own scheduler, obviating the need for an underlying real-time operating system.  ...  Acknowledgements This work is supported by NASA Contract NNL08AD13T. We thank Ben Di Vito for his direction and input.  ... 
doi:10.1007/978-3-642-16612-9_26 fatcat:szapoj7zp5fvbn5x5s3nk26bfq

A Verified and Compositional Translation of LTL to Deterministic Rabin Automata

Julian Brunner, Benedikt Seidl, Salomon Sickert, Michael Wagner
2019 International Conference on Interactive Theorem Proving  
We present a formalisation of the unified translation approach from linear temporal logic (LTL) to ω-automata from [19] .  ...  generic, executable, and expressive automata library providing necessary operations on automata to re-combine the "simple" languages; third, we instantiate this generic theory to obtain a construction  ...  Linear Temporal Logic We base our contribution on the LTL entry found in the AFP [41] and extend it where necessary.  ... 
doi:10.4230/lipics.itp.2019.11 dblp:conf/itp/0001SS19 fatcat:zhsmqsspyfcd3f4uggptl3t7le

PhD Abstracts

2014 Journal of functional programming  
A dissertation is eligible if parts of it have or could have appeared in JFP, that is, if it is in the general area of functional programming. The abstracts are not reviewed.  ...  into the generation process, with common generic optimizations provided by the framework.  ...  Finally, temporal properties of signals and of functions on signals are expressed using techniques from temporal logic, as motivation and justification for a range of optimisations.  ... 
doi:10.1017/s0956796814000215 fatcat:rs2j5wgm5ndf7ek2zls5pmg2w4

Applications of polyhedral computations to the analysis and verification of hardware and software systems

Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
2009 Theoretical Computer Science  
We survey the range of applications of polyhedral computations in this area; give an overview of the different classes of polyhedra that may be adopted; outline the main polyhedral operations required by  ...  For instance, the precise approximation of a polyhedron by a bounding box (resp., a bounded difference or octagon) can be implemented by a linear (resp., quadratic) number of optimizations of a class of  ...  At the other extreme, linear programming (LP) optimization techniques may be used so as to obtain the best match in the considered class of geometric shapes.  ... 
doi:10.1016/j.tcs.2009.07.033 fatcat:dnp6uoljs5cahaih6oov4pmwye

Formalizing Stack Safety as a Security Property [article]

Sean Noble Anderson, Leonidas Lampropoulos, Roberto Blanco, Benjamin C. Pierce, Andrew Tolmach
2021 arXiv   pre-print
We use these properties to validate the stack safety micro-policies proposed by Roessler and DeHon [2018].  ...  We propose a generic, formal characterization of stack safety based on concepts from language-based security: a combination of an integrity property ("the private state in each caller's stack frame is  ...  As a case study, we explore how our properties are enforced by the Depth Isolation micro-policy of Roessler and DeHon [1] , but not by some of its optimized variants (Section VI). • We formalize weaker  ... 
arXiv:2105.00417v2 fatcat:d427wibse5ahpcv3uisdtdx4hq

Session Types with Arithmetic Refinements

Ankush Das, Frank Pfenning, Laura Kovács, Igor Konnov
2020 International Conference on Concurrency Theory  
In this paper we extend the type system by using index refinements from linear arithmetic capturing intrinsic attributes of data structures and algorithms.  ...  practical, but incomplete algorithm for type equality, which we have used in our implementation of Rast, a concurrent session-typed language with arithmetic index refinements as well as ergometric and temporal  ...  Generalizing the idea of "Design by Contract" [29] to distributed domains, session types have been elaborated with logical predicates to obtain global assertions [4] .  ... 
doi:10.4230/lipics.concur.2020.13 dblp:conf/concur/DasP20 fatcat:p3t4rb55gra5vjovd73i4rafwq
« Previous Showing results 1 — 15 out of 63 results