Sciweavers

200 search results - page 24 / 40
» Invariant Logics
Sort
View
TNN
2010
147views Management» more  TNN 2010»
13 years 2 months ago
State-space analysis of Boolean networks
This paper provides a comprehensive framework for the state space approach to Boolean networks. First, it surveys the authors' recent work on the topic: Using semitensor produ...
Daizhan Cheng, Hongsheng Qi
CADE
2011
Springer
12 years 7 months ago
Exploiting Symmetry in SMT Problems
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
David Déharbe, Pascal Fontaine, Stephan Mer...
FOSSACS
2009
Springer
14 years 2 months ago
Beyond Shapes: Lists with Ordered Data
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
Kshitij Bansal, Rémi Brochenin, Étie...
TPHOL
2005
IEEE
14 years 1 months ago
Alpha-Structural Recursion and Induction
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
Andrew M. Pitts
SAC
2009
ACM
14 years 2 months ago
Network protocol interoperability testing based on contextual signatures and passive testing
This paper presents a methodology for interoperability testing based on contextual signatures and passive testing with invariants. The concept of contextual signature offers a fra...
Fatiha Zaïdi, Emmanuel Bayse, Ana R. Cavalli