Sciweavers

30 search results - page 4 / 6
» tacas 2007
Sort
View
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
14 years 2 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
TACAS
2007
Springer
67views Algorithms» more  TACAS 2007»
14 years 2 months ago
Searching for Shapes in Cryptographic Protocols
Abstract. We describe a method for enumerating all essentially different executions possible for a cryptographic protocol. We call them the shapes of the protocol. Naturally occur...
Shaddin F. Doghmi, Joshua D. Guttman, F. Javier Th...
FASE
2007
Springer
14 years 2 months ago
Software Product Families: Towards Compositionality
- Static Analysis and Abstract Interpretation I (Chair: Sophia Drossopulou, room: Multicert) • FASE - Specification (Chair: Marsha Chechik, room: Cisco) • TACAS - Specificati...
Jan Bosch
TACAS
2007
Springer
92views Algorithms» more  TACAS 2007»
14 years 2 months ago
Model Checking Liveness Properties of Genetic Regulatory Networks
Abstract. Recent studies have demonstrated the possibility to build genetic regulatory networks that confer a desired behavior to a living organism. However, the design of these ne...
Grégory Batt, Calin Belta, Ron Weiss
TACAS
2007
Springer
144views Algorithms» more  TACAS 2007»
14 years 2 months ago
Detecting Races in Ensembles of Message Sequence Charts
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
Edith Elkind, Blaise Genest, Doron Peled