Sciweavers

425 search results - page 52 / 85
» The TPS Theorem Proving System
Sort
View
ARITH
2003
IEEE
15 years 3 months ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger
ADG
2006
Springer
191views Mathematics» more  ADG 2006»
15 years 1 months ago
Automatic Verification of Regular Constructions in Dynamic Geometry Systems
We present an application of an automatic theorem proving (ATP) in the verification of constructions made with dynamic geometry software (DGS). Given a specification language for g...
Predrag Janicic, Pedro Quaresma
ICFP
2009
ACM
15 years 10 months ago
A functional I/O system or, fun for freshman kids
Functional programming languages ought to play a central role in mathematics education for middle schools (age range: 10?14). After all, functional programming is a form of algebr...
Matthias Felleisen, Robert Bruce Findler, Matthew ...
IANDC
2006
103views more  IANDC 2006»
14 years 9 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
ENTCS
2007
137views more  ENTCS 2007»
14 years 9 months ago
Formal Sequentialization of Distributed Systems via Program Rewriting
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...