Sciweavers

2604 search results - page 404 / 521
» General constant expressions for system programming language...
Sort
View
POPL
2010
ACM
16 years 1 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
CP
2004
Springer
15 years 9 months ago
Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
Andrew Sadler, Carmen Gervet
ICSE
2008
IEEE-ACM
16 years 4 months ago
Security protocols, properties, and their monitoring
This paper examines the suitability and use of runtime verification as means for monitoring security protocols and their properties. In particular, we employ the runtime verificat...
Andreas Bauer 0002, Jan Jürjens
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
15 years 5 months ago
Exploiting the path of least resistance in evolution
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
Gearoid Murphy, Conor Ryan
ICSE
2011
IEEE-ACM
14 years 7 months ago
Always-available static and dynamic feedback
Developers who write code in a statically typed language are denied the ability to obtain dynamic feedback by executing their code during periods when it fails the static type che...
Michael Bayne, Richard Cook, Michael D. Ernst