DIMACS 1996 | Sciweavers

63

DIMACS
1996

173views Theoretical Computer Science» more DIMACS 1996»

14 years 14 days ago

in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...

Ronald Fagin

claim paper

Read More »

36

click to vote

DIMACS
1996

106views Theoretical Computer Science» more DIMACS 1996»

Model Checking and the Mu-calculus

14 years 14 days ago

Download www.ccs.neu.edu

There is a growing recognition of the need to apply formal mathematical methods in the design of \high con dence" computing systems. Such systems operate in safety critical co...

E. Allen Emerson

claim paper

Read More »

41

click to vote

DIMACS
1996

133views Theoretical Computer Science» more DIMACS 1996»

On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic

14 years 14 days ago

Download www.labri.fr

: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...

Bruno Courcelle

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers