Sciweavers

425 search results - page 58 / 85
» The TPS Theorem Proving System
Sort
View
FAC
2000
124views more  FAC 2000»
14 years 9 months ago
Algebraic Models of Correctness for Microprocessors
In this paper we present a method of describing microprocessors at different levels of temporal and data abstraction. We consider microprogrammed, pipelined and superscalar proces...
Anthony C. J. Fox, Neal A. Harman
93
Voted
WDAG
2009
Springer
77views Algorithms» more  WDAG 2009»
15 years 4 months ago
Nonblocking Algorithms and Backward Simulation
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
Simon Doherty, Mark Moir
LICS
2008
IEEE
15 years 4 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
FMICS
2007
Springer
15 years 3 months ago
Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization
Using PVS (Prototype Verification System), we prove that an industry designed scheduler for a smartcard personalization machine is safe and optimal. This scheduler has previously ...
Leonard Lensink, Sjaak Smetsers, Marko C. J. D. va...
IUI
2006
ACM
15 years 3 months ago
Eye-tracking to model and adapt to user meta-cognition in intelligent learning environments
In this paper we describe research on using eye-tracking data for on-line assessment of user meta-cognitive behavior during the interaction with an intelligent learning environmen...
Christina Merten, Cristina Conati