Results 1 to 10 of about 6,864,933 (152)
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 The tree automaton completion is an algorithm used for proving safety properties of systems that can be modeled by a term rewriting system. This representation and verification technique works well for proving properties of infinite systems like ...
Benoît Boyer, Thomas Genet
doaj +1 more source
Journal for the History of Analytical Philosophy, 2021 In this paper, I aim to reconstruct and discuss Stanley Cavell’s interpretation and critique of analytic philosophy. Cavell objects to the tradition of analytic philosophy that, in its eagerness to provide abstract, theoretical reconstructions, it has ...
Espen Hammer
doaj +1 more source
Logical Methods in Computer Science, 2015 Given a Kripke structure M and CTL formula $\varphi$, where M does not satisfy $\varphi$, the problem of Model Repair is to obtain a new model M' such that M' satisfies $\varphi$.
George Chatzieleftheriou +3 more
doaj +1 more source
Model Checking Social Network Models [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 A social network service is a platform to build social relations among people sharing similar interests and activities. The underlying structure of a social networks service is the social graph, where nodes represent users and the arcs represent the ...
Raúl Pardo, Gerardo Schneider
doaj +1 more source
Faithful Modeling of Product Lines with Kripke Structures and Modal Logic [PDF]
Scientific Annals of Computer Science, 2016 Software product lines are now an established framework for software design. They are specified by special diagrams called feature models. For formal analysis, the latter are usually encoded by Boolean propositional theories.
Z. Diskin +3 more
doaj +1 more source
Quantified CTL: Expressiveness and Complexity [PDF]
Logical Methods in Computer Science, 2014 While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to ...
François Laroussinie, Nicolas Markey
doaj +1 more source
Formalizing the use case model: A model-based approach.
PLoS ONE, 2020 In general, requirements expressed in natural language are the first step in the software development process and are documented in the form of use cases. These requirements can be specified formally using some precise mathematical notation (e.g.
Qamar Uz Zaman +2 more
doaj +1 more source
Studia Universitatis Babeş-Bolyai. Philologia, 2021 Narrative Language and Possible Worlds in Postmodern Fiction. A Borderline Study of Ian McEwan’s The Child in Time. The present paper is a study of more traditional hermeneutics combined with a tinge of possible world modality, with the purpose of ...
Adriana Diana URIAN
doaj +1 more source
Characteristic Formulae for Fixed-Point Semantics: A General Framework [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable
Luca Aceto +2 more
doaj +1 more source
Type Directed Partial Evaluation for Level-1 Shift and Reset [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We present an implementation in the Coq proof assistant of type directed partial evaluation (TDPE) algorithms for call-by-name and call-by-value versions of shift and reset delimited control operators, and in presence of strong sum types.
Danko Ilik
doaj +1 more source