Filters








156 Hits in 3.3 sec

Automated workarounds from Java program specifications based on SAT solving

Marcelo Uva, Pablo Ponzio, Germán Regis, Nazareno Aguirre, Marcelo F. Frias
2018 International Journal on Software Tools for Technology Transfer (STTT)  
These techniques employ SAT solving to compute workarounds on concrete program state characterizations.  ...  operations from which workarounds are computed, diminishing the automation of workaround-based system recovery.  ...  Let us now turn our attention to our first technique for computing automated workarounds for Java program specifications, employing the SAT based automated analysis described in the previous section.  ... 
doi:10.1007/s10009-018-0503-8 fatcat:b6dkkffohvay3i4xlanwlkzif4

Software quality tools and techniques presented in FASE'17

Marieke Huisman, Julia Rubin
2018 International Journal on Software Tools for Technology Transfer (STTT)  
It introduces the papers that focus on this topic and that have been selected from the 20th International Conference on Fundamental Approaches to Software Engineering (FASE'17).  ...  This special issue of Software Tools for Technology Transfer is concerned with the foundations on which software quality assurance is built.  ...  Acknowledgements We are grateful to all the authors for their contributions and to the program committee of FASE'17 for their help for selecting the conference program, including the papers for this issue  ... 
doi:10.1007/s10009-018-0504-7 fatcat:pnytzgeky5gilkhufbhbrnoemi

Solver Requirements for Interactive Configuration

Andreas Falkner, Alois Haselböck, Gerfried Krames, Gottfried Schenner, Herwig Schreiner, Richard Taupe
2020 Journal of universal computer science (Online)  
Representative of many reasoning systems and tools used for implementing product configurators, we selected MiniZinc, Choco, Potassco, Picat, CP-SAT solver, and Z3 for evaluation and reviewed them against  ...  Acknowledgements The authors are thankful to Charles Prud'homme, Max Ostrowski, Philipp Obermeier, Philipp Wanko, and Torsten Schaub for their comments on a previous version of this article.  ...  CP-SAT Solver As an example of a constraint solver based on a non-constraint propagation paradigm we have chosen Google CP-SAT Solver, which is part of Google OR-Tools and based on boolean satisfiability  ... 
doi:10.3897/jucs.2020.019 fatcat:3wqzhtnskjfazobe6tgokdpcey

The 1st Verified Software Competition: Experience Report [chapter]

Vladimir Klebanov, Peter Müller, Natarajan Shankar, Gary T. Leavens, Valentin Wüstholz, Eyad Alkassar, Rob Arthan, Derek Bronish, Rod Chapman, Ernie Cohen, Mark Hillebrand, Bart Jacobs (+10 others)
2011 Lecture Notes in Computer Science  
We, the organizers and participants, report our experiences from the 1st Verified Software Competition, held in August 2010 in Edinburgh at the VSTTE 2010 conference.  ...  For example, for Invert we proved surjectivity of A from injectivity and boundedness.  ...  Introduction Research on SAT solving and automatic theorem proving has been boosted by the competitions held in connections with conferences such as SAT, CADE, and CAV.  ... 
doi:10.1007/978-3-642-21437-0_14 fatcat:vkjleltbkrdchok44arrshxfua

Jedd

Ondřej Lhoták, Laurie Hendren
2004 Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation - PLDI '04  
Based on our very positive experience with using BDDs for program analysis, we embarked on a project to express a number of key, interrelated whole program analyses for Java using BDDs inside our Java  ...  Our solution, and the topic of this paper, was the development of: (1) Jedd, a language extension to Java, which provides a high-level way of programming BDD-based algorithms based on relations and operations  ... 
doi:10.1145/996841.996861 dblp:conf/pldi/LhotakH04 fatcat:rsyjmsxcffhgtgo2jj2vzk2tie

Jedd

Ondřej Lhoták, Laurie Hendren
2004 SIGPLAN notices  
Based on our very positive experience with using BDDs for program analysis, we embarked on a project to express a number of key, interrelated whole program analyses for Java using BDDs inside our Java  ...  Our solution, and the topic of this paper, was the development of: (1) Jedd, a language extension to Java, which provides a high-level way of programming BDD-based algorithms based on relations and operations  ... 
doi:10.1145/996893.996861 fatcat:f4glbtcqe5gsnjhxf3mlgwfzdq

Type checking annotation-based product lines

Christian Kästner, Sven Apel, Thomas Thüm, Gunter Saake
2012 ACM Transactions on Software Engineering and Methodology  
Software-product-line engineering is an efficient means to generate a family of program variants for a domain from a single code base.  ...  Specifically, we extend the Featherweight Java calculus with feature annotations for product-line development and prove formally that all program variants generated from a well-typed product line are well-typed  ...  We are grateful for valuable feedback from Klaus Ostermann, Tillman Rendel, and the anonymous TOSEM reviewers.  ... 
doi:10.1145/2211616.2211617 fatcat:cfkghzoatbgf3l3sfw6qbuk7ve

Guaranteeing Syntactic Correctness for All Product Line Variants: A Language-Independent Approach [chapter]

Christian Kästner, Sven Apel, Salvador Trujillo, Martin Kuhlemann, Don Batory
2009 Lecture Notes in Business Information Processing  
Furthermore, we automate the generation of plug-ins for additional languages from annotated grammars.  ...  A software product line (SPL) is a family of related program variants in a well-defined domain, generated from a set of features.  ...  programs for the Haskell case study, and Sagar Sunkle for releasing the annotated SQL grammars.  ... 
doi:10.1007/978-3-642-02571-6_11 fatcat:tuumahj6lbawtbxlzc5bwudt2u

Automatic and efficient simulation of operation contracts

Matthias P. Krieger, Alexander Knapp, Burkhart Wolff
2011 SIGPLAN notices  
It is implemented in our tool OCLexec that generates from UML/OCL operation contracts corresponding Java implementations which call a constraint solver at runtime.  ...  ., determining operation results satisfying the postconditions based on input data supplied by the user; simulating operation contracts is an important technique for requirements validation and prototyping  ...  These animators do not use SAT solving like OCLexec does, but rely on other constraint solving techniques.  ... 
doi:10.1145/1942788.1868303 fatcat:ldleigiryvbexmric3vyj4minq

Automatic and efficient simulation of operation contracts

Matthias P. Krieger, Alexander Knapp, Burkhart Wolff
2010 Proceedings of the ninth international conference on Generative programming and component engineering - GPCE '10  
It is implemented in our tool OCLexec that generates from UML/OCL operation contracts corresponding Java implementations which call a constraint solver at runtime.  ...  ., determining operation results satisfying the postconditions based on input data supplied by the user; simulating operation contracts is an important technique for requirements validation and prototyping  ...  These animators do not use SAT solving like OCLexec does, but rely on other constraint solving techniques.  ... 
doi:10.1145/1868294.1868303 dblp:conf/gpce/KriegerKW10 fatcat:rt3vssiffrd3bnr2qnlie5gi6q

Type-Checking Software Product Lines - A Formal Approach

Christian Kastner, Sven Apel
2008 2008 23rd IEEE/ACM International Conference on Automated Software Engineering  
A software product line (SPL) is an efficient means to generate a family of program variants for a domain from a single code base.  ...  In this paper, we extend the Featherweight Java (FJ) calculus with feature annotations to be used for SPLs.  ...  Their tool now transforms the presence conditions and OCL constraints into a propositional formula that can be solved by an off-the-shelf SAT solver in one step.  ... 
doi:10.1109/ase.2008.36 dblp:conf/kbse/KastnerA08 fatcat:nugnqwbdhrhcddul2h6sxjyoue

Constraint Solver Requirements for Interactive Configuration

Andreas A. Falkner, Alois Haselböck, Gerfried Krames, Gottfried Schenner, Richard Taupe
2019 International Configuration Workshop  
The main two components of an interactive configurator are a user interface on the front-end and a knowledge representation and reasoning (KRR) framework on the back-end.  ...  In this paper we discuss important requirements for the underlying KRR system to support an interactive configuration process while focusing on classical constraint satisfaction as one of the most prominent  ...  is propagation-based, one is a representative of constraint logic programming, and one is SAT-based.  ... 
dblp:conf/confws/FalknerHKST19 fatcat:2a3rbzmahvfzhip52muluye7xi

Jolie Static Type Checker: a prototype [article]

Daniel de Carvalho, Manuel Mazzara, Bogdan Mingela, Larisa Safina, Alexander Tchitchigin, Nikolay Troshkov
2017 arXiv   pre-print
In this paper, we describe a prototype of Jolie Static Type Checker (JSTC), which employs a technique based on a SMT solver.  ...  Formal verification of software programs involves proving that a program satisfies a formal specification of its behavior. Many languages use both static and dynamic type checking.  ...  F* [1] instead an ML-like functional programming language specifically designed for program verification.The F* type-checker uses a combination of SMT solving and manual proofs to guarantee correctness  ... 
arXiv:1702.07146v5 fatcat:b4mn4bqtjfhqfdao32zjqhldfe

Refinement to Imperative/HOL [chapter]

Peter Lammich
2015 Lecture Notes in Computer Science  
We have used Sepref for several verification projects, resulting in efficient verified implementations that are competitive with unverified ones in Java or C++.  ...  We provide a tool to automatically synthesize a concrete imperative program and a refinement proof from an abstract functional program, selecting implementations of abstract data types according to a user-provided  ...  Moreover, we thank Thomas Tuerk for interesting discussions about automation of separation logic.  ... 
doi:10.1007/978-3-319-22102-1_17 fatcat:quut7vzv2bbahkg7ms6dwyke3a

Jolie Static Type Checker: a Prototype

Daniel De Carvalho, Manuel Mazzara, Bogdan Mingela, Larisa Safina, Alexander Tchitchigin, Nikolay Troshkov
2017 Modelirovanie i Analiz Informacionnyh Sistem  
In this paper, we describe a prototype of Jolie Static Type Checker (JSTC), which employs a technique based on a SMT solver.  ...  Formal verification of software programs involves proving that a program satisfies a formal specification of its behavior. Many languages use both static and dynamic type checking.  ...  F* [36] instead an ML-like functional programming language specifically designed for program verification.  ... 
doi:10.18255/1818-1015-2017-6-704-717 fatcat:iob44rd5nbbvfoxuwnxu52ryfa
« Previous Showing results 1 — 15 out of 156 results