Sciweavers

4940 search results - page 84 / 988
» On the Complexity of Universal Programs
Sort
View
CAV
2003
Springer
188views Hardware» more  CAV 2003»
15 years 8 months ago
Thread-Modular Abstraction Refinement
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
125
Voted
HICSS
2003
IEEE
132views Biometrics» more  HICSS 2003»
15 years 9 months ago
Supporting Collaborative Exercises for Distance Education
At the German Distance Learning University, collaborative synchronous exercises have been recently identified by students and teachers as an important future form of collaborative...
Jörg M. Haake, Till Schümmer, Anja Haake
SIGSOFT
2007
ACM
16 years 5 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
ICALP
1998
Springer
15 years 8 months ago
Difficult Configurations - On the Complexity of LTrL
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
Igor Walukiewicz
136
Voted
PADL
2000
Springer
15 years 8 months ago
A Logic-Based Information System
In this article we present the University of Evora's Integrated Information System (SIIUE), which is meant to model most of the information necessary for the management and da...
Salvador Abreu