Accepted Papers

Accepted Papers:

• Theory of Grammar Constraints,
  Meinolf Sellmann
• Approximability of Integer Programming with Generalised Constraints Peter Jonsson,
  Fredrik Kuivinen and Gustav Nordh
• Constraint Satisfaction with Bounded Treewidth Revised,
  Marko Samer and Stefan Szeider
• An Algebraic Characterisation of Complexity for Valued Constraints
  David Cohen, Martin Cooper and Peter Jeavons
• A Structural Characterization of Temporal Dynamic Controllability,
  Pali Morris
• Infinite Qualitative Simulations by Means of Constraint Programming,
  Krzysztof R. Apt and Sebastian Brand
• General Symmetry Breaking Constraints,
  Toby Walsh
• Decomposition of multi-operator queries on semiring-based graphical models,
  Cedric Pralet, Thomas Schiex and Gerard Verfaillie
• Mini-bucket Elimination with Bucket Propagation,
  Emma Rollon and Javier Larrosa
• Localization of an underwater robot using interval constraint propagation,
  Luc jaulin
• CoJava: Optimization Modeling by Non-Deterministic Simulation,
  Alexander Brodsky and Hadon Nash
• Generalized Arc Consistency for Positive Table Constraints,
  Christophe Lecoutre and Radoslaw Szymanek
• Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs,
  Michele Lombardi and Michela Milano
• The ROOTS constraint,
  Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan and Toby Walsh
• Boosting Open CSPs,
  Santiago Macho González, Carlos Ansótegui and Pedro Meseguer
• Towards an Efficient SAT Encoding for Temporal Reasoing,
  Duc Nghia Pham, Abdul Sattar and John Thornton
• Graph Properties Based Filtering,
  Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey and Thierry Petit
• Inner and Outer Approximations of Existentially Quantified Equality Constraints,
  Alexandre Goldsztejn and Luc Jaulin
• Adaptive Clause Weight Redistribution Abdelraouf Ishtaiwi,
  John Thornton, Anbulagan A., Abdul Sattar and Duc Nghia Pham
• High-Level Nondeterministic Abstractions in C++,
  Laurent Michel, Andrew See and Pascal Van Hentenryck
• Differentiable Invariants,
  Pascal Van Hentenryck and Laurent Michel
• Dynamic Lex Constraints,
  Jean-Francois Puget
• Compiling Finite Linear CSP into SAT
  Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa and Mutsunori Banbara
• Randomization in Constraint Programming for Airline Planning,
  Lars Otten, Mattias Grönkvist and Devdatt Dubhashi
• Preprocessing QBF,
  Horst Samulowitz, Jessica Davies and Fahiem Bacchus
• Propagation in CSP and SAT,
  Yannis Dimopoulos and Kostas Stergiou
• When Constraint Programming and Local Search Solve the Scheduling Problem of Electricite de France Nuclear Power Plant Outages,
  Mohand Ou Idir KHEMMOUDJ, Marc PORCHERON and Hachemi Bennaceur
• Algorithms for Stochastic CSPs,
  Thanasis Balafoutis and Kostas Stergiou
• A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem,
  Matthew Streeter and Stephen Smith
• Generalizing AllDifferent: the SomeDifferent Constraint,
  Yossi Richter, Ari Freund and Yehuda Naveh
• Generating Propagators for Finite Set Constraints Guido Tack
  , Christian Schulte and Gert Smolka
• The Minimum Spanning Tree Constraint,
  Gregoire Dooms and Irit Katriel
• Distributed Constraint-Based Local Search,
  Laurent Michel, Andrew See and Pascal Van Hentenryck
• Typed Guarded Decompositions for Constraint Satisfaction,
  David Cohen and Martin Green
• Compiling Constraint Networks into AND/OR Multi-Valued Decision Diagrams (AOMDDs),
  Robert Mateescu and Rina Dechter
• Constraint Programming Models for Graceful Graphs,
  Barbara Smith
• Watched Literals for Constraint Propagation in Minion Ian Gent,
  Chris Jefferson and Ian Miguel
• Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms,
  Frank Hutter, Youssef Hamadi, Holger Hoos and Kevin Leyton-Brown
• Revisiting the Sequence Constraint,
  Willem-Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau and Ashish Sabharwal
• When Interval Analysis Helps Inter-Block Backtracking,
  Bertrand Neveu, Gilles Chabert and Gilles Trombettoni
• Impact of censored sampling on the performance of restart strategies,
  Matteo Gagliolo and Juergen Schmidhuber
• BlockSolve: a Bottom-Up Approach for Solving Quantified CSPs,
  Guillaume Verger and Christian Bessiere

Accepted posters

• Dynamic Symmetry Breaking Restarted
  Daniel Heller and Meinolf Sellmann
• Static and Dynamic Structural Symmetry Breaking,
  Pierre Flener, Justin Pearson, Meinolf Sellmann and Pascal Van Hentenryck
• A filter for the circuit constraint,
  Latife Genc Kaya and John Hooker
• Soft arc consistency applied to optimal planning,
  Martin Cooper, Sylvain Cussat-Blanc, Marie de Roquemaurel and Pierre Régnier
• Inferring Variable Conflicts for Local Search,
  Magnus Agren, Pierre Flener and Justin Pearson
• Sports League Scheduling: Enumerative Search for Prob026 from CSPLib,
  Jean-Philippe Hamiez and Jin-Kao Hao
• A New Algorithm for Sampling CSP Solutions Uniformly at Random,
  Vibhav Gogate and Rina Dechter
• Global Grammar Constraints,
  Claude-Guy Quimper and Toby Walsh
• Clique Inference Process for Solving Max-CSP,
  Mohand Ou Idir KHEMMOUDJ and Hachemi BENNACEUR
• Constraint Propagation for Domain Bounding in C_TAEMS Task Scheduling,
  Evan A. Sultanik, Pragnesh Jay Modi and William C. Regli
• Retroactive Dynamic Backtracking on CSPs,
  Roie Zivan, Moshe Zazone, Uri Shapen and Amnon Meisels
• Distributed stable matching problems with ties and incomplete lists,
  Ismel Brito and Pedro Meseguer
• Reasoning by dominance in Not-Equals binary constraint networks,
  Belaid Benhamou and Mohammed Réda Saidi
• Relaxations and Explanations for Quantified Constraint Satisfaction Problems,
  Alex Ferguson and Barry O'Sullivan
• An extension of complexity bounds and dynamic heuristics for tree-decompositions of CSP,
  Philippe Jégou, Samba Ndojh Ndiaye and Cyril Terrioux
• Interactive Distributed Configuration,
  Peter Tiedemann, Tarik Hadzic, Stuart Henney and Henrik Reif Andersen
• Heavy-tailed Runtime Distributions: Heuristics, Models and Optimal,
  Tudor Hulubei and Barry O'Sullivan
• Failure Analysis in Backtrack Search for Constraint Satisfaction,
  Tudor Hulubei and Barry O'Sullivan
• A Note on Low Autocorrelation Binary Sequences,
  Ivan Dotu and Pascal Van Hentenryck
• The Effect of Constraint Representation on Structural Tractability,
  Christopher Houghton, David Cohen and Martin Green
• The Modelling Language Zinc,
  Maria Garcia de la Banda, Kim Marriott, Reza Rafeh and Mark Wallace

• Allen Van Gelder and Geoff Sutcliffe. Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation
• Juergen Giesl, Peter Schneider-Kamp and Rene Thiemann. AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework
• Joe Hendrix, Jose Meseguer and Hitoshi Ohsaki. A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
• Predrag Janicic and Pedro Quaresma. System Description: GCLCprover + GeoThms
• Steven Obua and Sebastian Skalberg. Importing HOL into Isabelle/HOL
• Boontawee Suntisrivaraporn, Franz Baader and Carsten Lutz. CEL---A Practical Reasoner for Life Science Ontologies
• Dmitry Tsarkov and Ian Horrocks. FaCT++ Description Logic Reasoner: System Description
• Jürgen Zimmer and Serge Autexier. The MathServe Framework for Semantic Reasoning Web Services

• Peter Baumgartner and Renate A. Schmidt. Improved Bottom-Up Model Generation
• Bernhard Beckert and Andre Platzer. Dynamic Logic with Non-rigid Functions
• Christoph E. Benzmueller, Chad E. Brown and Michael Kohlhase. Cut- Simulation in Impredicative Logics
• Sylvie Boldo. Pitfalls of a full floating-point proof: example on the formal proof of the Veltkamp/Dekker algorithms
• Maria Paola Bonacina, Silvio Ghilardi, Enrica Nicolini, Silvio Ranise and Daniele Zucchelli. Decidability and Undecidability Results for Nelson-Oppen and Rewrite-based Decision Procedures
• Chad E. Brown. Combining Type Theory and Untyped Set Theory
• Amine Chaieb. Verifying mixed real-integer quantifier elimination
• Kaustuv Chaudhuri, Frank Pfenning and Greg Price. A logical characterization of forward and backward chaining in the inverse method
• Robert Constable and Wojciech Moczydlowski. Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics
• Stephane Demri and Denis Lugiez. Presburger Modal Logic is Only PSPACE-complete
• Roy Dyckhoff, Delia Kesner and Stephane Lengrand. Strong cut- elimination systems for Hudelmaier's depth-bounded sequent calculus for implicational logic
• Daniel Dougherty, Kathi Fisler and Shriram Krishnamurthi. Specifying and Reasoning about Dynamic Access Control Policies
• Joerg Endrullis, Johannes Waldmann and Hans Zantema. Matrix Interpretations for Proving Termination of Term Rewriting
• Grègoire Benjamin and Thèry Laurent. Certifying large prime numbers: a purely functional library for modular arithmetic
• Olga Grinchtein, Martin Leucker and Nir Piterman. Inferring Network Invariants Automatically
• John Harrison. Towards self-verification of HOL Light
• Florent Jacquemard, Michael Rusinowitch and Laurent Vigneron. Tree automata with equality constraints modulo equational theories
• Xiang Xue Jia and Jian Zhang. A Powerful Technique to Eliminate Isomorphism in Finite Model
• Yevgeny Kazakov and Boris Motik. A Resolution-Based Decision Procedure for SHOIQ
• Adam Koprowski and Hans Zantema. Recursive Path Ordering for Infinite Labelled Rewrite Systems
• Dexter Kozen, Christoph Kreitz and Eva Richter. Automating Proofs in Category Theory
• Alexander Krauss. Partial Recursive Functions in Higher-Order Logic
• Shuvendu Lahiri and Madanlal Musuvathi. Solving Sparse Linear Constraints
• Jordi Levy, Manfred Schmidt-Schauss and Mateu Villaret. Stratified Context Unification is NP-complete
• Assia Mahboubi. Proving formally the implementation of an efficient gcd algorithm for polynomials
• Sean McLaughlin. An Interpretation of Isabelle/HOL in HOL Light
• Tobias Nipkow and Gertrud Bauer. Flyspeck I: Tame Graphs
• Hans de Nivelle and Jia Meng. Geometric Resolution: A Proof Procedure Based on Finite Model Search
• Andrei Paskevich. Connection Tableaux with Lazy Paramodulation
• Brigitte Pientka. Eliminating redundancy in higher-order unification:a lightweight approach
• Florian Rabe. First-Order Logic with Dependent Types
• Erik Reeber and Warren A. Hunt, Jr.. A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA)
• Viorica Sofronie-Stokkermans. Interpolation in local theory extensions
• Volker Sorge, Andreas Meier, Roy McCasland and Simon Colton. The Automatic Construction of Isotopy Invariants
• Geoff Sutcliffe, Stephan Schulz, Koen Claessen and Allen Van Gelder. Using the TPTP Language for Writing Derivations and Finite Interpretations
• David Toman and Grant Weddell. On Keys and Functional Dependencies as First-class Citizens in Description Logics
• Christian Urban and Stefan Berghofer. A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
• Daria Walukiewicz-Chrzaszcz and Jacek Chrzaszcz. Consistency and Completeness of Rewriting in the Calculus of Constructions
• Benjamin Werner. On the strength of proof-irrelevant type theories
• Anna Zamansky and Arnon Avron. Canonical Gentzen-type calculi with (n,k)-ary quantifiers
• Roland Zumkeller. Formal Global Optimization with Taylor Models

• Marc Aiguier, Karim Berkani and Pascale Le Gall. Feature specification and static analysis for interaction resolution
• Nuno Amálio, Susan Stepney and Fiona Polack. A Formal Template Language enabling Metaproof
• Cyrille Valentin Artho, Armin Biere and Shinichi Honiden. Enforcer -- Efficient Failure Injection
• Stefano Bacherini, Alessandro Fantechi, Matteo Tempestini and Niccolň Zingoni. A Story about Formal Methods Adoption by a Railway Signaling Manufacturer
• Fabian Bannwart and Peter Müller. Changing Programs Correctly: Refactoring with Specifications
• Sandrine Blazy, Zaynah Dargaye and Xavier Leroy. Formal verification of a C compiler front-end
• Jewgenij Botaschanjan, Alexander Gruler, Alexander Harhurin, Leonid Kof, Maria Spichkova and David Trachtenherz. Towards Modularized Verification of Distributed Time-Triggered Systems
• Raymond Boute. Using Domain-Independent Problems for Introducing Formal Methods
• Greg Brunet, Marsha Chechik and Sebastian Uchitel. Properties of Behavioural Model Merging
• Alcino Cunha, José Nuno Oliveira and Joost Visser. Type-safe Two-level Data Transformation
• Frederic Dadeau, Fabrice Bouquet and Bruno Legeard. Automated Boundary Test Generation from JML Specifications
• David Delahaye, Jean-Frédéric Étienne and Véronique Viguié Donzeau-Gouge. Certifying Airport Security Regulations using the Focal Environment
• Alastair F. Donaldson and Alice Miller. Exact and Approximate Strategies for Symmetry Reduction in Model Checking
• Neil Evans and Michael Butler. A Proposal for Records in Event-B
• Angela Freitas and Ana Lucia Caneca Cavalcanti. Automatic translation from Circus to Java
• Alexandre Genon, Thierry Massart and Cédric Meuter. Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences is Needed to Model-Check Traces
• Peter Hofner, Bernhard Moeller and Ridha Khedri. Feature Algebras
• Quang Thuan Huynh and Abhik Roychoudhury. A Memory Model Sensitive Checker for C#
• Wendy Johnston, Kirsten Winter, Lionel van den Berg, Paul Strooper and Peter Robinson. Model-based Variable and Transition Orderings for efficient Symbolic Model Checking
• Ioannis Kassios. Dynamic Frames: Support for Framing, Dependencies and Sharing without Restrictions
• Zarrin Langari and Richard Trefler. Formal Modeling of Communication Protocols By Graph Transformations
• Kim G. Larsen, Ulrik Nyman and Andrzej Wasowski. Interface Input/Output Automata
• Xin Li, Jim Hoover and Piotr Rudnicki. Towards Automatic Exception Safety Verification
• Mass Soldal Lund and Ketil Střlen. A Fully General Operational Semantics for UML 2.0 Sequence Diagrams with Potential and Mandatory Choice
• Tim McComb and Graeme Smith. Compositional Class Refinement in Object-Z
• Annabelle McIver. Quantitative refinement and model checking for the analysis of probabilistic systems
• Wojciech Mostowski. Formal Reasoning about Non-Atomic Java Card Metho ds in Dynamic Logic
• José Nuno Oliveira and Cesar Jesus Rodrigues. Pointfree Factorization of Operation Refinement
• Viorel Preoteasa. Mechanical Verification of Recursive Procedures Manipulating Pointers using Separation Logic
• Gerhard Schellhorn, Holger Grandy, Dominik Haneberg and Wolfgang Reif. The Mondex Challenge: Machine Checked Proofs for an Electronic Purse
• Jonathan Schmitt, Alwin Hoffmann, Michael Balser, Wolfgang Reif and Mar Marcos. Interactive Verification of Medical Guidelines
• Shinya Umeno and Nancy Lynch. Proving safety properties of an aircraft landing protocol using I/O Automata and the PVS theorem prover: a case study
• Marcel Verhoef, Peter Gorm Larsen and Jozef Hooman. Modeling and Validating Distributed Embedded Real-Time Systems with VDM++
• Aleksandr Zaks and Amir Pnueli. PSL Model Checking and Run-time Verification via Testers
• Pamela Zave. Compositional Binding in Network Domains
• Yujun Zheng, Jinquan Wang and Kan Wang. Partially Introducing Formal Methods into Object-Oriented Development: case studies using a metrics-driven approach

• AR (Action Rules): The Language, Implementation, and Applications (Invited Talk)
  Neng-Fa Zhou (CUNY Brooklyn College and Graduate Center)
  

• H. Guo, M. Liu. Embedding Solution Preferences via Transformation
• T. Soares, M. Ferreira, R. Rocha, N. Fonseca. On Applying Deductive Databases to Inductive Logic Programming: a Performance Study
• R. Rocha. Efficient Support for Incomplete and Complete Tables in the YapTab Tabling System
• B. Demoen, P-L. Nguyen. Delay and events in the TOAM and the WAM
• Q. Phan, G. Janssens. Towards Region-based Memory Management for Mercury Programs
• R. Troncon, B. Demoen, G. Janssens. When tabling does not work
• P. Costa, R. Rocha, M. Ferreira. DBTAB: a Relational Storage Model for the YapTab Tabling System
• L. Chrpa. Linear Logic: Foundations, Applications and Implementations

Louise Abigail Dennis
Program Slicing and Middle-Out Reasoning for Error Location and Repair

André Rognes
Automated relative consistency proving

Mahadevan Subramaniam, Deepak Kapur, and Stephan Falke
Predicting Failures of Inductive Proof Attempts

Markus Aderhold, Christoph Walther, Daniel Szallies, and Andreas Schlosser
A Fast Disprover for VeriFun

Lee Pike, Paul Miner, and Wilfredo Torres-Pomales
Diagnosing a Failed Proof in Fault-Tolerance: A Disproving Challenge Problem

Peter Baumgartner, Alexander Fuchs, Cesare Tinelli, and Hans de Nivelle
Computing Finite Models by Reduction to Function-Free Clause Logic

Thomas Hillenbrand, Dalibor Topic, and Christoph Weidenbach
Sudokus as Logical Puzzles

Juan Carlos López Pimentel, Raúl Monroy, and Dieter Hutter
A method for patching interleaving-replay attacks in faulty security protocols 

Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, and Hans Tompits
dlvhex: A Tool for Semantic-Web Reasoning under the Answer-Set Semantics

Stijn Heymans, Livia Predoiu, Cristina Feier, Jos de Bruijn, and Davy Van Nieuwenborgh
G-Hybrid Knowledge Bases

Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits, and Kewen Wang
Forgetting in Managing Rules and Ontologies

Srividya Kona, Ajay Bansal, Gopal Gupta, and Thomas Hite
Efficient Web Service Discovery and Composition using Constraint Logic Programming

Edna Ruckhaus, Maria-Esther Vidal, and Eduardo Ruiz
Query Evaluation and Optimization in the Semantic Web

Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello, Marco Montali, and Paolo Torroni
Policy-based reasoning for smart web service interaction

Viviana Mascardi, Giovanni Casella
Intelligent Agents that Reason about Web Services: a Logic Programming Approach 

Lengning Liu, Mirek Truszczynski
Solving Optimization Problems with Boolean Combinations of Pseudo-boolean Constraints (a preliminary report)

Martin Gebser, Torsten Schaub
Characterizing ASP Inferences by Unit Propagation

John Schlipf, Ryan Flannery
Unfounded Sets and Autarkies

Murray Patterson, Yongmei Liu, Eugenia Ternovska, and Arvind Gupta
Grounding for Model Expansion in $k$-Guarded Formulas

Johannes Oetsch, Martina Seidl, Hans Tompits, and Stefan Woltran
ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming

Enrico Giunchiglia, Yuliya Lierler, Marco Maratea, and Armando Tacchella
Experiments with SAT-based Answer Set Programming

Maarten Mariën, Johan Wittocx, and Marc Denecker
The IDP framework for declarative problem solving 

Zoran Majkic
Functional Many-valued Logic and Global Predicate Compression

Alan Bond
A distributed modular logic programming model based on the cortex

Rajesh Kumar, Ashish Tiwari, and Bruce Krogh
EOLC: Efficiently Modelling Inconsistency for Commonsense Reasoning

Ajay Mallya
Horn-based Multi-Valued Verification

Andrew Mironov, Virendra Bhavsar
Fuzzy Modal Logics 

Mauricio Osorio, Claudia Zepeda
Preferences for General Theories in Answer Sets

James Delgrande, Torsten Schaub, and Hans Tompits
A Preference-Based Framework for Updating Logic Programs: Preliminary Report

Alessandra Mileo, Torsten Schaub
Extending Ordered Disjunctions for Policy Enforcement: Preliminary report

Toshiko Wakaki, Kazuo Tomita
Compiling Prioritized Circumscription into General Disjunctive Programs

Tu Phan, Tran Son, and Enrico Pontelli
Planning with Preferences Using Constraint Logic Programming

Pallavi Tambay, Bharat Jayaraman
Relaxation in Preference Logic Programs 

Pascal Lafourcade, Denis Lugiez, and Ralf Treinen
ACUNh: Unification and Disunification Using Automata Theory

Temur Kutsia, Mircea Marin
Solving Regular Constraints for Hedges and Contexts

Max Tuengerthal, Ralf Kuesters, and Mathieu Turuani
Implementing a Unification Algorithm for Protocol Analysis with XOR

Sjaak Smetsers, Arjen van Weelden
Bracket Abstraction Preserves Typability

Paliath Narendran, Pavithra Ramarathnam
Unification modulo ACUI with collapsing homomorphisms

Edwin Westbrook
Pattern Solutions to Higher-Order Unification Problems

Jorge Coelho, Mário Florido
Unification with Flexible Arity Symbols: a Typed Approach

Adel bouhoula, Florent Jacquemard
Automating Sufficient Completeness Check for Conditional and Constrained TRS

Franz Baader, Alexander Okhotin
Complexity of language equations with one-sided concatenation and all Boolean operations 

Michael Hanus
CurryBrowser: A Generic Analysis Environment for Curry Programs

Edison Mera, Pedro Lopez-Garcia, German Puebla, Manuel Carro, and Manuel Hermenegildo
Combining Static Analysis and Profiling for Estimating Execution Times in Logic Programs

Kim Henriksen, John Gallagher
A Web-based Tool Combining Different Type Analyses

Siddharth Chitnis, Madhu Yennamani, and Gopal Gupta
ExSched: Solving Constraint Satisfaction Problems with the Spreadsheet Paradigm

Pierre DERANSART
On using Tracer Driver for External Dynamic Process Observation (extended abstract)

Alexander Serebrenik, Wim Vanhoof
Fingerprinting Logic Programs

Remko Troncon, Gerda Janssens
A Delta Debugger for ILP Query Execution

Elvira Albert, Puri Arenas, and German Puebla
Some Issues on Incremental Abstraction-Carrying Code

Hani Girgis, Bharat Jayaraman
A Logic-based Debugger for Java 

Elvira Albert, Miguel Gómez-Zamalloa, Laurent Hubert, and German Puebla
Java Bytecode Verification using Analysis and Transformation of Logic Programs

Achim D. Brucker, Burkhart Wolff
A Package for Extensible Object-Oriented Data Models with an Application to IMP++

Stefano Tonetta, Natasha Sharygina
A Uniform Framework for Predicate Abstraction Approximation

Dieu Donne Okalas Ossami, Jeanine Souquieres, and Jean-Pierre Jacquot
Ensuring Specifications Correctness by Construction

Luke Simon, Ajay Mallya, Ajay Bansal, and Gopal Gupta
Co-Logic Programming: Extending Logic Programming with Coinduction

Aleks Zaks, Ilya Shlyakhter, Franjo Ivancic, Srihari Cadambi, Zijiang Yang, Malay Ganai, Aarti Gupta, and Pranav Ashar
Using Range Analysis for Software Verification

Ganna Zaks, Amir Pnueli
Translation Validation of Interprocedural Optimizations 

1. Ludwig Krippahl, Pedro Barahona. Chemera: Constraints in Protein Structural Problems.
2. Sebastian Will and Martin Mann. Counting Protein Structures by DFS with Dynamic Decomposition
3. Alessandro Dal Palu', Agostino Dovier, and Enrico Pontelli. Global Constraints for Discrete Lattices
4. Elisabetta De Maria, Agostino Dovier, Carla Piazza, and Angelo Montanari. Exploiting Model Checking in Constraint-based Approaches to the Protein Folding Problem.
5. Patrick Prosser. Supertree Construction with Constraint Programming: recent progress and new challenges.
6. Luca Bortolussi and Alberto Policriti. Modeling Biological Systems in Stochastic Concurrent Constraint Programming
7. Matthias Zytnicki, Christine Gaspin, and Thomas Schiex. Suffix arrays and weighted CSPs

Accepted Tool Description Papers