Sciweavers

108 search results - page 9 / 22

» iandc 2006

51

IANDC
2010

57views more IANDC 2010»

Non-interleaving bisimulation equivalences on Basic Parallel Processes

14 years 10 months ago

Non-interleaving bisimulation equivalences on Basic Parallel Processes

Download www.cs.vsb.cz

Sibylle B. Fröschle, Petr Jancar, Slawomir La...

claim paper

Read More »

60

IANDC
2010

58views more IANDC 2010»

Efficient algorithms for the block edit problems

14 years 10 months ago

Efficient algorithms for the block edit problems

Download par.cse.nsysu.edu.tw

Hsing-Yen Ann, Chang-Biau Yang, Yung-Hsing Peng, B...

claim paper

Read More »

86

IANDC
2006

95views more IANDC 2006»

The alternation hierarchy in fixpoint logic with chop is strict too

14 years 12 months ago

The alternation hierarchy in fixpoint logic with chop is strict too

Download www2.tcs.ifi.lmu.de

Fixpoint Logic with Chop extends the modal

Martin Lange

claim paper

Read More »

55

IANDC
2006

52views more IANDC 2006»

Incompleteness of states w.r.t. traces in model checking

14 years 12 months ago

Incompleteness of states w.r.t. traces in model checking

Download www.math.unipd.it

Cousot and Cousot introduced and studied a general past/future-time specification language, called

Roberto Giacobazzi, Francesco Ranzato

claim paper

Read More »

77

IANDC
2000

70views more IANDC 2000»

A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems

14 years 11 months ago

A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems

Download www.nuprl.org

Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...

Christoph Kreitz, Stephan Schmitt

claim paper

Read More »

« Prev « First page 9 / 22 Last » Next »