Sciweavers

10575 search results - page 1888 / 2115
» Programming Languages
Sort
View
NFM
2011
223views Formal Methods» more  NFM 2011»
15 years 1 months ago
opaal: A Lattice Model Checker
Abstract. We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstracti...
Andreas Engelbredt Dalsgaard, René Rydhof H...
JAPLL
2010
111views more  JAPLL 2010»
15 years 1 months ago
The complexity of satisfiability for fragments of hybrid logic - Part I
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
Arne Meier, Martin Mundhenk, Thomas Schneider 0002...
SIGSOFT
2007
ACM
16 years 7 months ago
Mining specifications of malicious behavior
Malware detectors require a specification of malicious behavior. Typically, these specifications are manually constructed by investigating known malware. We present an automatic t...
Mihai Christodorescu, Somesh Jha, Christopher Krue...
CAV
2009
Springer
133views Hardware» more  CAV 2009»
16 years 7 months ago
Cardinality Abstraction for Declarative Networking Applications
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
Andrey Rybalchenko, Atul Singh, Juan Antonio Navar...
FOSSACS
2009
Springer
16 years 1 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
« Prev « First page 1888 / 2115 Last » Next »