Sciweavers

3552 search results - page 313 / 711
» Proof theory in the abstract
Sort
View
CADE
2008
Springer
16 years 7 months ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
16 years 1 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
MFCS
2009
Springer
16 years 1 months ago
A General Class of Models of
Abstract. We recently introduced an extensional model of the pure λcalculus living in a cartesian closed category of sets and relations. In this paper, we provide sufficient condi...
Giulio Manzonetto
CEC
2008
IEEE
16 years 1 months ago
An approach to intrusion detection by means of idiotypic networks paradigm
Abstract— In this paper we present a novel intrusion detection architecture based on Idiotypic Network Theory (INIDIS), that aims at dealing with large scale network attacks feat...
Marek Ostaszewski, Pascal Bouvry, Franciszek Sered...
DIS
2007
Springer
16 years 27 days ago
Computational Discovery in Pure Mathematics
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated th...
Simon Colton