Sciweavers

88 search results - page 14 / 18
» Nominal Reasoning Techniques in Coq: (Extended Abstract)
Sort
View
HASKELL
2009
ACM
14 years 1 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
WCRE
2003
IEEE
14 years 18 days ago
Detecting Merging and Splitting using Origin Analysis
Merging and splitting source code artifacts is a common activity during the lifespan of a software system; as developers rethink the essential structure of a system or plan for a ...
Lijie Zou, Michael W. Godfrey
LPAR
2012
Springer
12 years 2 months ago
The TPTP Typed First-Order Form with Arithmetic
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Pe...
APPT
2009
Springer
14 years 1 months ago
A Fast Scheme to Investigate Thermal-Aware Scheduling Policy for Multicore Processors
Abstract. With more cores integrated into one single chip, the overall power consumption from the multiple concurrent running programs increases dramatically in a CMP processor whi...
Liqiang He, Cha Narisu
GECCO
2004
Springer
14 years 22 days ago
Dynamic Limits for Bloat Control: Variations on Size and Depth
Abstract. We present two important variations on a recently successful bloat control technique, Dynamic Maximum Tree Depth, intended at further improving the results and extending ...
Sara Silva, Ernesto Costa