Sciweavers

348 search results - page 35 / 70
» Using Case-Based Reasoning to Write Constraint Programs
Sort
View
IEE
2008
115views more  IEE 2008»
15 years 2 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller
117
Voted
CPAIOR
2007
Springer
15 years 8 months ago
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
Jan-Georg Smaus
128
Voted
ASPLOS
2012
ACM
13 years 10 months ago
Applying transactional memory to concurrency bugs
Multithreaded programs often suffer from synchronization bugs such as atomicity violations and deadlocks. These bugs arise from complicated locking strategies and ad hoc synchroni...
Haris Volos, Andres Jaan Tack, Michael M. Swift, S...
ICALT
2005
IEEE
15 years 8 months ago
Learning from the Pitfalls of a Case Sharing Web
Using cases for teaching and learning has received growing attention in teacher training programs. This project intends to build a web forum for student teachers to discuss their ...
Shihkuan Hsu
ESOP
2006
Springer
15 years 6 months ago
Bisimulations for Untyped Imperative Objects
We present a sound and complete method for reasoning about contextual equivalence in the untyped, imperative object calculus of Abadi and Cardelli [1]. Our method is based on bisim...
Vasileios Koutavas, Mitchell Wand