Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Radu Iosif"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 3 (2014)
We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating executio
Externí odkaz:
https://doaj.org/article/26e58fb05f53467ab2996778debc30ee
Publikováno v:
Proceedings of the ACM on Programming Languages. 6:145-174
This paper presents a Hoare-style calculus for formal reasoning about reconfiguration programs of distributed systems. Such programs create and delete components and/or interactions (connectors) while the system components change state according to t
Publikováno v:
Formal Methods in System Design
Formal Methods in System Design, Springer Verlag, 2020, ⟨10.1007/s10703-020-00345-1⟩
Formal Methods in System Design, Springer Verlag, 2020, ⟨10.1007/s10703-020-00345-1⟩
International audience; A generic register automaton is a finite automaton equipped with variables (which may be viewed as counters or, more generally, registers) ranging over infinite data domains. A trace of a generic register automaton is an alter
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020
This article investigates the satisfiability problem for Separation Logic with k record fields, with unrestricted nesting of separating conjunctions and implications. It focuses on prenex formulæ with a quantifier prefix in the language ∃*∀* tha
Publikováno v:
Automated Reasoning ISBN: 9783031107689
We consider a logic used to describe sets of configurations of distributed systems, whose network topologies can be changed at runtime, by reconfiguration programs. The logic uses inductive definitions to describe networks with an unbounded number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a4e5d584bf2026456c4cd55820fac4c
https://doi.org/10.1007/978-3-031-10769-6_40
https://doi.org/10.1007/978-3-031-10769-6_40
Publikováno v:
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Tools and Algorithms for the Construction and Analysis of Systems
Tools and Algorithms for the Construction and Analysis of Systems
Tools and Algorithms for the Construction and Analysis of Systems-26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings, Part I
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030451899
TACAS (1)
Lecture Notes in Computer Science-Tools and Algorithms for the Construction and Analysis of Systems
Tools and Algorithms for the Construction and Analysis of Systems
Tools and Algorithms for the Construction and Analysis of Systems-26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings, Part I
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030451899
TACAS (1)
We consider parameterized concurrent systems consisting of a finite but unknown number of components, obtained by replicating a given set of finite state automata. Components communicate by executing atomic interactions whose participants update thei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f8775802d0461d22d3c0e302f73b208
https://doi.org/10.26226/morressier.604907f51a80aac83ca25d93
https://doi.org/10.26226/morressier.604907f51a80aac83ca25d93
Autor:
Marius Bozga, Radu Iosif
Publikováno v:
Formal Aspects of Component Software ISBN: 9783030906351
FACS
FACS
We introduce a term algebra as a new formal specification language for the coordinating architectures of distributed systems consisting of a finite yet unbounded number of components. The language allows to describe infinite sets of systems whose coo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87b921fb23c22d5b137f80b5560effeb
https://doi.org/10.1007/978-3-030-90636-8_6
https://doi.org/10.1007/978-3-030-90636-8_6
We study a sound verification method for parametric component-based systems. The method uses a resource logic, a new formal specification language for distributed systems consisting of a finite yet unbounded number of components. The logic allows the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7376e8d955a8094832cad56d9839ce2a
Publikováno v:
LPAR
LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
LPAR 2020
LPAR 2020, 2020, Alicante, Spain. ⟨10.1145/3380809⟩
LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
LPAR 2020
LPAR 2020, 2020, Alicante, Spain. ⟨10.1145/3380809⟩
The entailment between separation logic formulæ with inductive predicates, also known as sym- bolic heaps, has been shown to be decidable for a large class of inductive definitions [7]. Recently, a 2-EXPTIME algorithm was proposed [10, 14] and an EX
Publikováno v:
Automated Deduction-{CADE} 28-28th International Conference on Automated Deduction, Virtual Event, July 12-15, 2021, Proceedings}
CADE 28
CADE 28, 2021, Pittsburgh (virtual), United States. pp.183-199, ⟨10.1007/978-3-030-79876-5_11⟩
Automated Deduction – CADE 28 ISBN: 9783030798758
CADE
CADE 28
CADE 28, 2021, Pittsburgh (virtual), United States. pp.183-199, ⟨10.1007/978-3-030-79876-5_11⟩
Automated Deduction – CADE 28 ISBN: 9783030798758
CADE
The entailment problem$$\upvarphi \models \uppsi $$φ⊧ψin Separation Logic [12, 15], between separated conjunctions of equational ($$x \approx y$$x≈yand$$x \not \approx y$$x≉y), spatial ($$x \mapsto (y_1,\ldots ,y_\upkappa )$$x↦(y1,…,yκ))
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a0ed2edeaa876481a43d5556a817b9e