Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Emmanuel Zarpas"'
Autor:
Patrick Bellot, Jean-Pierre Cottin, Bernard Robinet, Emmanuel Zarpas, Djamil Sarni, J. Leneutre
Publikováno v:
Studia Logica. 62:77-105
We present in this article a new logical system inspired from linear logic. This system is designed in order to express causality and dynamism. The cut elimination theorem holds for this logic. Examples of applications are given.
Governance is the exercise of control and direction over a subject such as a society, an organization, processes, or artifacts, by using laws and policies that are defined, deployed, and executed. In this chapter we develop this definition into a for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1773761310912ef9d916c4c5481683db
https://doi.org/10.4018/978-1-60566-008-0.ch015
https://doi.org/10.4018/978-1-60566-008-0.ch015
Publikováno v:
POLICY
Policies can be understood as specifications; therefore they can be translated more or less easily into formal languages and then be verified by formal techniques such as model checking. In this paper, we focus on formal verification of real-life ind
Publikováno v:
Next Generation Design and Verification Methodologies for Distributed Embedded Control Systems ISBN: 9781402062537
In recent years, the language PSL (Property Specification Language, a.k.a. IEEE P1850) has been embraced and put to successful use by chip design/verification engineers across the electronics industry. While PSL is mainly used for hardware ver- ifica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fbe4180b5d0ddc624f191f5613159a1c
https://doi.org/10.1007/978-1-4020-6254-4_19
https://doi.org/10.1007/978-1-4020-6254-4_19
Autor:
Emmanuel Zarpas
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540291053
CHARME
CHARME
Over the past ten years, the Formal Methods group at the IBM Haifa Research Lab has made steady progress developing tools and techniques that bring the power of model checking to the community of hardware designers and verification engineers, making
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9befb92bf650816b092b283e8b213775
https://doi.org/10.1007/11560548_42
https://doi.org/10.1007/11560548_42
Autor:
Emmanuel Zarpas
Publikováno v:
Theory and Applications of Satisfiability Testing ISBN: 9783540262763
SAT
SAT
Modern SAT solvers are highly dependent on heuristics. Therefore, benchmarking is of prime importance in evaluating the performances of different solvers. However, relevant benchmarking is not necessarily straightforward. We present our experiments u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bb8c4dc45b8e724c6dd7128a7db00fd
https://doi.org/10.1007/11499107_25
https://doi.org/10.1007/11499107_25
Autor:
Ohad Shacham, Emmanuel Zarpas
Publikováno v:
MTV
Bounded model checking (BMC) techniques have been used for formal hardware verification, with the help of tools such as GRASP (generic search algorithm for satisfiability problem) and more recently zchaff. In order to cope with very large hardware de
Autor:
Emmanuel Zarpas
Publikováno v:
Formal Methods in Computer-Aided Design ISBN: 9783540237389
FMCAD
FMCAD
In this paper, we show how proper benchmarking, which matches day-to-day use of formal methods, allows us to assess direct improvements for SAT use for formal methods. Proper uses of our benchmark allowed us to prove that previous results on tuning S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9273b535f05e18cd59b21429de4e03f
https://doi.org/10.1007/978-3-540-30494-4_13
https://doi.org/10.1007/978-3-540-30494-4_13