A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
A modular formalization of the branching time temporal logic CTL * is presented. ... Our formalization subsumes prior formalizations of propositional linear temporal logic (PTL) and computation tree logic (CTL). ... We would like to thank Yih-Kuen Tsay and anonymous reviewers for their constructive comments in improving the paper. ...doi:10.1007/978-3-540-77505-8_25 fatcat:gpybn4vc3na4lczjjcvkmfe2dy
Synthesis of programs with iteration or recursion requires inductive proof, but standard techniques for the construction of appropriate induction rules are restricted to recycling the recursive structure ... Spec(i, prog(i)) Spec(i, o) is a logical specification of the relationship between the inputs i to the required program and its output o. ... Since the logic is constructive, sort will be (recursively) defined in terms of previously defined functions. ...doi:10.1016/j.entcs.2005.08.003 fatcat:wgcdnm2yxvdl3bxrt2wptuuezi
Lecture Notes in Computer Science
We give an overview of the coinductive logic programming paradigm. ... Co-LP can also be used for developing executable operational semantics of Π-calculus and linear-time temporal logic (LTL). ... In LTL, one checks if a temporal logic formula is true along a path. ...doi:10.1007/978-3-642-22944-2_4 fatcat:v2klxrhr6vfpfagwncfzpg56v4
The book provides a representative selection of Hall's enormously influential writings on cultural studies and its concerns: the relationship with marxism; postmodernism and 'New Times' in cultural and ... In addition to presenting classic writings by Hall and new interviews with Hall in dialogue with Kuan-Hsing Chen, the collection provides a detailed analysis of Hall's work and his contribution to the ... Acknowledgements xi Acknowledgements The editors thank the following for permission to include the essays collected in this book: for articles which originally appeared in the Journal of Communication ...doi:10.7202/1037917ar fatcat:agcfoye2anbsxip4nacojsbo3y
Our experience with co-logic programming indicates that it is an extremely useful paradigm for elegantly expressing algorithms that lie at the heart of model-checking technologies. ... A prototype security policy verification system for Action-Script binaries is presented, whose implementation leverages recent advances in co-logic programming. ... We also intend to explore the use of other temporal logics, especially Computation Tree Logic (CTL) and the µ-calculus  , for the specification of security policies. ...doi:10.1145/1554339.1554342 dblp:conf/pldi/DeVriesGHMS09 fatcat:gkclucx7hvesnkev32kkcc64pe
temporal logic in the calculus of inductive constructions. ... The calculus of (Co)-inductive constructions (CC) is obtained by adding to the CoC the possibility of defining inductive and co-inductive types. ...
We solve the longstanding open problems of the blowup involved in the translations (when possible) of a nondeterministic Büchi word automaton (NBW) to a nondeterministic co-Büchi word automaton (NCW) and ... We point to numerous applications of the new constructions. In particular, they imply a simple subset-construction based translation (when possible) of LTL to deterministic Büchi word automata. ... Examples include complementation, synthesis, game solving, temporal logic decidability, reasoning about Markov decision processes, monitoring-based run-time verification, and more. ...doi:10.1109/lics.2009.32 dblp:conf/lics/BokerK09 fatcat:icpdnxsd2nhmdgfhtl6e2bsbru
A central result is the co-inductive characterisation of contextual equivalence be- tween programs in a lazy functional programming language. ... In this paper, we show that the alternation hierarchy in arithmetic can be established by entirely elementary means; further, simple examples of strict alternation depth n formulae can be constructed, ...
We also show the corresponding results for the alternation-free fragment of the -calculus, where no alternations between least and greatest fixed points are allowed. ... One source of complexity in the -calculus is its ability to specify an unbounded number of switches between universal (AX) and existential (EX) branching modes. ... Acknowledgements We thank the anonymous reviewers for their detailed comments on the organization and on the proofs. ...doi:10.1016/j.tcs.2005.11.015 fatcat:zulrihp2krb6bgjxfworh4upwm
The Kluwer International Series in Engineering and Computer Science
These speci cations are much like deferred (or virtual) classes with assertions in Ei el. An object belonging to a class is an element of the state space of the class, as co-algebra. ... The co-algebraic perspective on objects and classes in object-oriented programming is elaborated: classes are described as co-algebras, which may occur as models (implementations) of co-algebraic speci ... In the type theoretic encoding of object-oriented constructs into second (or higher) order polymorphic lambda calculus (with subtyping), see e.g. 7, 23, 15], one uses the type 9 : Type: ( ! ...doi:10.1007/978-1-4613-1437-0_5 fatcat:mqs2gtg4rrawtarmunej5an5yu
We present a sound, complete, and optimal single-pass tableau algorithm for the alternation-free μ-calculus. ... The algorithm supports global caching with intermediate propagation and runs in time 2^O(n). ... In consequence, our results apply also to the alternation-free fragments of the alternating-time µ-calculus , probabilistic fixpoint logics, and the monotone µ-calculus (the ambient fixpoint logic of ...arXiv:1609.06379v1 fatcat:7melkntcqfayhc7gylvrbm5nvq
We solve the longstanding open problems of the blow-up involved in the translations, when possible, of a nondeterministic Büchi word automaton (NBW) to a nondeterministic co-Büchi word automaton (NCW) ... In particular, they imply a simple subset-construction based translation, when possible, of LTL to deterministic Büchi word automata. ... The first class of applications uses the NCW directly. The premier example in this class is of symbolic linear temporal logic (LTL) model checking. ...doi:10.1145/2362355.2362357 fatcat:zo56oxcxlja6ln6ou6ep5ll3he
We focus in particular on the case of action verbs and develop a model by which a system can learn the grounded meaning of a verbal construction without assuming the prior existence of a corresponding ... Departing from this mapping approach, we present a computational model of the co-emergence of linguistic and conceptual structures. ... ACKNOWLEDGEMENTS This research/work was supported by the Cluster of Excellence Cognitive Interaction Technology 'CITEC' (EXC 277) at Bielefeld University, which is funded by the German Research Foundation ...doi:10.1109/tcds.2019.2900418 fatcat:oe6qxgekgraj5lzs22drrqqjni
The time domain of the proposed logics is bounded by a fixed positive integer. Despite the restriction on the time domain, the logics can derive almost all the typical temporal axioms of LTL. ... It is known that linear-time temporal logic (LTL), which is an extension of classical logic, is useful for expressing temporal reasoning as investigated in computer science. ... Acknowledgements Norihiro Kamide was supported by the Alexander von Humboldt Foundation and partially supported by the Japanese Ministry of Education, Culture, Sports, Science and Technology, Grant-in-Aid ...doi:10.1016/j.jal.2009.06.001 fatcat:u4zbyarfqvfrrgyc2rwcduzc2a
Journal of the ACM
In this paper we show that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics. ... Moreover, the simple combinatorial structure that emerges from the automata-theoretic approach opens up new possibilities for the implementation of branching-time model checking, and has enabled us to ... Acknowledgments We thank Thomas Wilke for helpful comments on a previous draft of this paper. ...doi:10.1145/333979.333987 fatcat:ae75n7kvkbgfzd7aiedmea6ypa
« Previous Showing results 1 — 15 out of 3,721 results