Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Software and its engineering → Software verification"'
Autor:
Altmeyer, Sebastian, André, Étienne, Dal Zilio, Silvano, Fejoz, Loïc, Harbour, Michael González, Graf, Susanne, Gutiérrez, J. Javier, Henia, Rafik, Le Botlan, Didier, Lipari, Giuseppe, Medina, Julio, Navet, Nicolas, Quinton, Sophie, Rivas, Juan M., Sun, Youcheng
We propose here solutions to the FMTV 2015 challenge of a distributed video processing system using four different formalisms, as well as the description of the challenge itself. This artifact contains several solutions to various subchallenges, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d58019f31fe0778ba1e1a848ab6c4fc
Publikováno v:
50th International Colloquium on Automata, Languages, and Programming
Leibniz International Proceedings in Informatics
Leibniz International Proceedings in Informatics
In the language-theoretic approach to refinement verification, we check that the language of traces of an implementation all belong to the language of a specification. We consider the refinement verification problem for asynchronous programs against
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ccad95b58bd52a96a4d3074e2706d4d7
https://hdl.handle.net/21.11116/0000-000D-6B42-121.11116/0000-000D-6B44-F
https://hdl.handle.net/21.11116/0000-000D-6B42-121.11116/0000-000D-6B44-F
Language Workbenches offer language designers an expressive environment in which to create their Domain Specific Languages (DSLs). Similarly, research into mechanised meta-theory has shown how dependently typed languages provide expressive environmen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3efce53a2d1a375a0dfa1a8a6ac04202
Context-bounded analysis of concurrent programs is a technique to compute a sequence of under-approximations of all behaviors of the program. For a fixed bound k, a context bounded analysis considers only those runs in which a single process is inter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11a227c4aaad7b5b133803852e5b9819
Autor:
Altmeyer, Sebastian, André, Étienne, Dal Zilio, Silvano, Fejoz, Loïc, Harbour, Michael González, Graf, Susanne, Gutiérrez, J. Javier, Henia, Rafik, Le Botlan, Didier, Lipari, Giuseppe, Medina, Julio, Navet, Nicolas, Quinton, Sophie, Rivas, Juan M., Sun, Youcheng
We present here the main features and lessons learned from the first edition of what has now become the ECRTS industrial challenge, together with the final description of the challenge and a comparative overview of the proposed solutions. This verifi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94afdeddba9f4b7edccf24c5ba909d3a
We introduce a new symbolic reflection API for implementing tool-independent summaries for the symbolic execution of C programs. We formalise the proposed API as a symbolic semantics and extend two state-of-the-art symbolic execution tools with suppo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e08b78c28e260cd81df2ab8a3a71a8a
The artifact contains the extended versions of the tools angr and AVD with support for the symbolic reflection API proposed in the paper. Additionally, the artifact contains the source code of SumBoundVerify, our novel tool for the bounded-verificati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3397d6fb657a7750f7acc4f4d877f38c
Autor:
Maggio, Martina
Feedback control is a central enabling technology in a wide range of applications. Control systems are at the core of energy distribution infrastructure, regulate the behaviour of engines in vehicles, and are embedded in household appliances like was
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9ed007742db3bdeb524f288650d85e3
Much of the past work on dynamic data-race and determinacy-race detection algorithms for task parallelism has focused on structured parallelism with fork-join constructs and, more recently, with future constructs. This paper addresses the problem of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a8b58a4d1d7da94ab004b36ab8d81de
Autor:
Jin, Feiyang, Yu, Lechen
Much of the past work on dynamic data-race and determinacy-race detection algorithms for task parallelism has focused on structured parallelism with fork-join constructs and, more recently, with future constructs. This paper addresses the problem of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6252f0d453563cd258dccabc6656311a