Sciweavers

263 search results - page 31 / 53
» Discrete Symbol Calculus
Sort
View
TABLEAUX
2000
Springer
13 years 11 months ago
MSPASS: Modal Reasoning by Translation and First-Order Resolution
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for ...
Ullrich Hustadt, Renate A. Schmidt
LFP
1992
153views more  LFP 1992»
13 years 8 months ago
Reasoning About Programs in Continuation-Passing Style
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
Amr Sabry, Matthias Felleisen
ITICSE
2000
ACM
13 years 12 months ago
Has our curriculum become math-phobic? (an American perspective)
We are concerned about a view in undergraduate computer science education, especially in the early courses, that it’s okay to be math-phobic and still prepare oneself to become ...
Charles Kelemen, Allen B. Tucker, Peter Henderson,...
ESORICS
2010
Springer
13 years 8 months ago
Election Verifiability in Electronic Voting Protocols
We present a formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus. Our definition is given in terms of bo...
Steve Kremer, Mark Ryan, Ben Smyth
ENTCS
2006
161views more  ENTCS 2006»
13 years 7 months ago
Algebraic Specification and Coalgebraic Synthesis of Mealy Automata
We introduce the notion of functional stream derivative, generalising the notion of input derivative of rational expressions (Brzozowski 1964) to the case of stream functions over...
Jan J. M. M. Rutten