199 search results - page 29 / 40 » A Fully Abstract Model for Graph-Interpreted Temporal Logic |
113
click to vote
ICFP
2010
ACM
15 years 2 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
142
click to vote
TIME
2006
IEEE
15 years 7 months ago
2006
IEEE
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
101
click to vote
VSTTE
2005
Springer
15 years 7 months ago
2005
Springer
The interplay back and forth between software model checking and hardware model checking has been fruitful for both. Originally intended for the analysis of concurrent software, mo...
103
click to vote
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
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...
154
Voted
FUIN
2007
15 years 1 months ago
2007
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...