Search Results - "theory of computation semantics and reasoning program reasoning invariants"
-
1
DySy: dynamic symbolic execution for invariant inference
ISBN: 1605580791, 9781605580791ISSN: 0270-5257Published: 01.01.2008Published in International Conference on Software Engineering 2008 (01.01.2008)“…Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic…”
Get full text
Journal Article -
2
Demystifying Template-Based Invariant Generation for Bit-Vector Programs
ISSN: 2643-1572Published: IEEE 11.09.2023Published in IEEE/ACM International Conference on Automated Software Engineering : [proceedings] (11.09.2023)“…The template-based approach to invariant generation is a parametric and relatively complete methodology for inferring loop invariants. The relative…”
Get full text
Conference Proceeding -
3
Quickly detecting relevant program invariants
ISBN: 1581132069, 9781581132069ISSN: 0270-5257Published: New York, NY, USA ACM 2000Published in Proceedings / International Conference on Software Engineering (2000)“…Explicitly stated program invariants can help programmers by characterizing certain aspects of program execution and identifying program properties that must…”
Get full text
Conference Proceeding Journal Article -
4
Generalizing specific-instance interpolation proofs with SyGuS
ISBN: 9781450356626, 1450356621Published: New York, NY, USA ACM 27.05.2018Published in 2018 IEEE ACM 40th International Conference on Software Engineering New Ideas and Emerging Technologies Results (ICSE NIER) (27.05.2018)“…Proving correctness1 of programs is a challenging task, and consequently has been the focus of a lot of research. One way to break this problem down is to look…”
Get full text
Conference Proceeding -
5
Deryaft: a tool for generating representation invariants of structurally complex data
ISBN: 1605580791, 9781605580791ISSN: 0270-5257Published: 01.01.2008Published in International Conference on Software Engineering 2008 (01.01.2008)“…Deryaft is a tool for generating likely representation invariants of structurally complex data. Given a small set of concrete structures, Deryaft analyzes…”
Get full text
Journal Article -
6
Automatic Loop Invariant Generation for Data Dependence Analysis
ISSN: 2575-5099Published: ACM 01.05.2022Published in 2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) (01.05.2022)“…Parallelization of programs relies on sound and precise analysis of data dependences in the code, specifically, when dealing with loops. State-of-art tools are…”
Get full text
Conference Proceeding -
7
Formal Specifications Investigated: A Classification and Analysis of Annotations for Deductive Verifiers
ISSN: 2575-5099Published: ACM 01.05.2022Published in 2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) (01.05.2022)“…Deductive verification can be used to ensure properties about all possible behaviours of a program, even when the program is parameterised and has an unbounded…”
Get full text
Conference Proceeding -
8
Dynamic symbolic data structure repair
ISBN: 9781605587196, 1605587192ISSN: 0270-5257Published: New York, NY, USA ACM 01.05.2010Published in 2010 ACM/IEEE 32nd International Conference on Software Engineering (01.05.2010)“…Generic repair of complex data structures is a new and exciting area of research. Existing approaches can integrate with good software engineering practices…”
Get full text
Conference Proceeding -
9
QED: a proof system based on reduction and abstraction for the static verification of concurrent software
ISBN: 9781605587196, 1605587192ISSN: 0270-5257Published: New York, NY, USA ACM 01.05.2010Published in 2010 ACM/IEEE 32nd International Conference on Software Engineering (01.05.2010)“…We present a proof system and supporting tool, QED, for the static verification of concurrent software. Our key idea is to simplify the verification of a…”
Get full text
Conference Proceeding -
10
Inferring annotations for device drivers from verification histories
Published: ACM 01.09.2016Published in Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering (01.09.2016)“…This paper studies and optimizes automated program verification. Detailed reasoning about software behavior is often facilitated by program invariants that…”
Get full text
Conference Proceeding -
11
Finding inconsistency for UML-based composition at program level
ISBN: 9781424437221, 1424437229ISSN: 2156-7883Published: Washington, DC, USA IEEE Computer Society 17.05.2009Published in 2009 ICSE Workshop on Modeling in Software Engineering (17.05.2009)“…In this paper, we study how to enforce the composition based on the Unified Modeling Language (UML 2.0) at the program level. We develop a novel technique for…”
Get full text
Conference Proceeding -
12
Feature-Based Decomposition of Inductive Proofs Applied to Real-Time Avionics Software: An Experience Report
ISBN: 9780769521633, 0769521630ISSN: 0270-5257Published: Washington, DC, USA IEEE Computer Society 23.05.2004Published in International Conference on Software Engineering: Proceedings of the 26th International Conference on Software Engineering; 23-28 May 2004 (23.05.2004)“…The hardware and software in modern aircraft control systems are good candidates for verification using formal methods: they are complex, safety-critical, and…”
Get full text
Conference Proceeding -
13
Precise control flow reconstruction using boolean logic
ISBN: 1450307140, 9781450307147Published: New York, NY, USA ACM 09.10.2011Published in Proceedings of the ninth ACM International Conference on Embedded Software (09.10.2011)“…This paper presents a SAT-based method for control flow graph reconstruction from executable code. The key idea of the technique is to express the semantics of…”
Get full text
Conference Proceeding -
14
IODINE: a tool to automatically infer dynamic invariants for hardware designs
ISBN: 1595930582, 9781595930583Published: New York, NY, USA ACM 13.06.2005Published in Proceedings 2005 : Design Automation Conference : Anaheim Convention Center, Anaheim, CA, June 13-17, 2005 (13.06.2005)“…We describe IODINE, a tool to automatically extract likely design properties using dynamic analysis. A practical bottleneck in the formal verication of…”
Get full text
Conference Proceeding -
15
Extending Dynamic Constraint Detection with Polymorphic Analysis
ISBN: 9780769529639, 0769529631Published: Washington, DC, USA IEEE Computer Society 20.05.2007Published in Proceedings of the 5th International Workshop on Dynamic Analysis (20.05.2007)“…The general technique for dynamically detecting likely invariants, as implemented by Daikon, lacks specific objectoriented support for polymorphism. Daikon…”
Get full text
Conference Proceeding -
16
Improving Ariadne's Bundle by Following Multiple Threads in Abstraction Refinement
ISBN: 9781581137620, 1581137621ISSN: 1092-3152Published: Washington, DC, USA IEEE Computer Society 09.11.2003Published in International Conference on Computer Aided Design: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design; 09-13 Nov. 2003 (09.11.2003)“…We propose an abstraction refinement method for invariant checking,which is based on the simultaneous analysis of all abstractcounter examples of shortest…”
Get full text
Conference Proceeding -
17
High Level Verification of Control Intensive Systems Using Predicate Abstraction
ISBN: 0769519237, 9780769519234Published: Washington, DC, USA IEEE Computer Society 24.06.2003Published in Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (24.06.2003)“…Predicate abstraction has been widely used for modelchecking hardware/software systems. However, for controlintensive systems, existing predicate abstraction…”
Get full text
Conference Proceeding

