Sciweavers

40 search results - page 8 / 8
» PDL over Accelerated Labeled Transition Systems
Sort
View
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 5 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
TLCA
2009
Springer
13 years 12 months ago
A Logical Foundation for Environment Classifiers
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...
Takeshi Tsukada, Atsushi Igarashi
SIGKDD
2010
259views more  SIGKDD 2010»
13 years 1 days ago
Activity recognition using cell phone accelerometers
Mobile devices are becoming increasingly sophisticated and the latest generation of smart cell phones now incorporates many diverse and powerful sensors. These sensors include GPS...
Jennifer R. Kwapisz, Gary M. Weiss, Samuel Moore
LICS
1994
IEEE
13 years 9 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
ENTCS
2008
146views more  ENTCS 2008»
13 years 5 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith