Sciweavers

2373 search results - page 117 / 475
» On the Theory of Structural Subtyping
Sort
View
ENTCS
1998
105views more  ENTCS 1998»
15 years 6 months ago
A Concurrent Object Calculus: Reduction and Typing
We obtain a new formalism for concurrent object-oriented languages by extending Abadi and Cardelli's imperative object calculus with operators for concurrency from the -calc...
Andrew D. Gordon, Paul D. Hankin
JAR
2007
132views more  JAR 2007»
15 years 6 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz
POPL
2011
ACM
14 years 9 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
KDD
2009
ACM
364views Data Mining» more  KDD 2009»
16 years 7 months ago
Causality quantification and its applications: structuring and modeling of multivariate time series
Time series prediction is an important issue in a wide range of areas. There are various real world processes whose states vary continuously, and those processes may have influenc...
Takashi Shibuya, Tatsuya Harada, Yasuo Kuniyoshi
ICFP
2001
ACM
16 years 6 months ago
Recursive Structures for Standard ML
Standard ML is a statically typed programming language that is suited for the construction of both small and large programs. "Programming in the small" is captured by St...
Claudio V. Russo