Filters








14,426 Hits in 7.8 sec

Towards A Case-Optimal Symbolic Execution Algorithm for Analyzing Strong Properties of Object-Oriented Programs

Xianghua Deng, Robby, John Hatcliff
2007 Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)  
In this paper, we present an enhancement to existing symbolic execution algorithms for object-oriented programs that significantly improves upon the algorithms currently implemented in Bogor/Kiasan and  ...  Recent work has demonstrated that symbolic execution techniques can serve as a basis for formal analysis capable of automatically checking heap-manipulating software components against strong interface  ...  reduces the state-space for symbolic execution of object-oriented programs while still preserving strong heap-oriented properties.  ... 
doi:10.1109/sefm.2007.43 dblp:conf/sefm/DengRH07 fatcat:peib575p6ffsvn4shqt37ld5yi

A survey of new trends in symbolic execution for software testing and analysis

Corina S. Păsăreanu, Willem Visser
2009 International Journal on Software Tools for Technology Transfer (STTT)  
We follow with a discussion of techniques that can be used to limit the (possibly infinite) number of symbolic configurations that need to be analyzed for the symbolic execution of looping programs.  ...  Symbolic execution is a well-known program analysis technique which represents program inputs with symbolic values instead of concrete, initialized, data and executes the program by manipulating program  ...  An example of a Java predicate is "the class invariant", or, repOk() boolean method [11, 63] for data structures in object-oriented code.  ... 
doi:10.1007/s10009-009-0118-1 fatcat:xhgvbsnuwbd3xa7shj3au3qndq

Forthcoming Papers

2003 Artificial Intelligence  
On the undecidability of probabilistic planning and related stochastic optimization problems Automated planning, the problem of how an agent achieves a goal given a repertoire of actions, is one of the  ...  Jonsson, Point algebras for temporal reasoning: Algorithms and complexity P.E. Dunne and T.J.M. Bench-Capon, Two Party Immediate Reponse Disputes: Properties and efficiency A.C.C. Say and H.L.  ...  We discover that neither method is optimal in a worst-case sense, by a factor of (log |V |/ log log |V |).  ... 
doi:10.1016/s0004-3702(03)00084-5 fatcat:ywtleopcbffkdcwj5isyi7b6dq

Goal-oriented dynamic test generation

TheAnh Do, Siau-Cheng Khoo, Alvis Cheuk Ming Fong, Russel Pears, Tho Thanh Quan
2015 Information and Software Technology  
A key objective of this research project is therefore to develop algorithms to perform path exploration toward effectively and efficiently executing dynamic symbolic execution.  ...  Symbolic Execution The semantics for the symbolic execution of the program is captured using a symbolic memory map S and a path condition φ.  ... 
doi:10.1016/j.infsof.2015.05.007 fatcat:ebdngmeyijdmbdo4e6kzqh4xte

Formal Software Analysis Emerging Trends in Software Model Checking

Matthew B. Dwyer, John Hatcliff, Robby Robby, Corina S. Pasareanu, Willem Visser
2007 Future of Software Engineering (FOSE '07)  
The past fifteen years have seen a marked and accelerating shift towards algorithmic formal reasoning about program behavior -we refer to these as formal software analysis.  ...  the promise of both finding errors and assuring important program properties.  ...  deep semantic properties of open object-oriented systems.  ... 
doi:10.1109/fose.2007.6 dblp:conf/icse/DwyerHRPV07 fatcat:ucvmmm75kjbyxluplh5z3y3x4q

Adaptive Online Program Analysis

Matthew B. Dwyer, Alex Kinneer, Sebastian Elbaum
2007 Proceedings / International Conference of Software Engineering  
Analyzing a program run can provide important insights about its correctness.  ...  In this paper, we present an approach for exploiting properties of stateful program specifications to reduce the cost of their dynamic analysis.  ...  Furthermore, for many properties it appears that adaptive overhead is confined to initialization time, and the rate of growth in runtime of adaptively analyzed programs and un-instrumented programs parallel  ... 
doi:10.1109/icse.2007.12 dblp:conf/icse/DwyerKE07 fatcat:3mbircprg5buxn2b34sa7ygndu

Probabilistic Software Modeling: A Data-driven Paradigm for Software Analysis [article]

Hannes Thaller, Lukas Linsbauer, Rudolf Ramler, Alexander Egyed
2019 arXiv   pre-print
The approach extracts the type, executable, and property structure of a program and copies its topology.  ...  PSM analyzes a program and synthesizes a network of probabilistic models that can simulate and quantify the original program's behavior.  ...  ACKNOWLEDGMENTS The research reported in this paper has been supported by the Austrian Ministry for Transport, Innovation and Technology, the Federal Ministry of Science, Research and Economy, and the  ... 
arXiv:1912.07936v2 fatcat:4f4n3p4awvgs7lcgk2ndma67oy

Test input generation for java containers using state matching

Willem Visser, Corina S. Pǎsǎreanu, Radek Pelánek
2006 Proceedings of the 2006 international symposium on Software testing and analysis - ISSTA'06  
The popularity of object-oriented programming has led to the wide use of container libraries. It is important for the reliability of these containers that they are tested adequately.  ...  Exhaustive techniques use model checking with explicit or symbolic execution to explore all the possible test sequences up to predefined input sizes.  ...  The state of a symbolically executed program includes the (symbolic) values of program variables, a path condition (PC) and a program counter.  ... 
doi:10.1145/1146238.1146243 dblp:conf/issta/VisserPP06 fatcat:2x5dwej6u5es7ewwmva6au6msu

Evolutionary Generation of Whole Test Suites

Gordon Fraser, Andrea Arcuri
2011 2011 11th International Conference on Quality Software  
We present EVOSUITE, a search-based approach that optimizes whole test suites towards satisfying a coverage criterion, rather than generating distinct test cases directed towards distinct coverage goals  ...  There is, however, a fundamental problem with the general idea of targeting one distinct test coverage goal at a time: Coverage goals are neither independent of each other, nor is test generation for any  ...  We thank Valentin Dallmeier, Yana Mileva, Andrzej Wasylkowski and Andreas Zeller for comments on earlier versions of this paper.  ... 
doi:10.1109/qsic.2011.19 dblp:conf/qsic/FraserA11 fatcat:5onyrxkvpzci7bkmyowlpwhf4m

Lightweight compilation of (C)LP to JavaScript

JOSE F. MORALES, RÉMY HAEMMERLÉ, MANUEL CARRO, MANUEL V. HERMENEGILDO
2012 Theory and Practice of Logic Programming  
Targeting JavaScript makes (C)LP programs executable in virtually every modern computing device with no additional software requirements from the point of view of the user.  ...  We present an overview of the compilation process and a detailed description of the run-time system, including the support for modular compilation into separate JavaScript code.  ...  This reliance makes it possible to execute code on a variety of devices without any need for installation of additional plug-ins or proprietary code.  ... 
doi:10.1017/s1471068412000336 fatcat:reuxpfqs6bbotlgfcg6dp5j6ia

Runtime Verification Past Experiences and Future Projections [chapter]

Klaus Havelund, Giles Reger, Grigore Roşu
2019 Lecture Notes in Computer Science  
Runtime verification is the discipline of analyzing program/system executions using rigorous methods.  ...  The discipline covers such topics as specificationbased monitoring, where single executions are checked against formal specifications; predictive runtime analysis, where properties about a system are predicted  ...  The following symbols are used for arguments: C stands for a condition to be verified and R stands for a reaction to be executed in case a condition gets violated.  ... 
doi:10.1007/978-3-319-91908-9_25 fatcat:owudlqherneptb7smodwctj37y

Recent advances on trusted computing in China

Wei Dong, LiQian Chen
2012 Chinese Science Bulletin  
[24] proposed a so-called slicing execution that is a lightweight symbolic execution, to extract abstract models from C programs by considering only part of the program variables.  ...  [7] analyzed the problems of the current property attestation and proposed a new property attestation protocol on bilinear map for trusted cryptographic module by exploiting the cryptographic feature  ... 
doi:10.1007/s11434-012-5550-z fatcat:nyevowgxtnfyjmhghtwjw5wuuy

Towards a Unified View of Modeling and Programming [chapter]

Manfred Broy, Klaus Havelund, Rahul Kumar
2016 Lecture Notes in Computer Science  
Models are meant to describe a system at a high level of abstraction for the purpose of human understanding and analysis. Programs, on the other hand, are meant for execution.  ...  In this paper we argue that there is a value in providing a unified view of modeling and programming.  ...  It is even considered one of the strong sides of object-orientation, that one can have a unified view of object-oriented specification, object-oriented design, and object-oriented programming.  ... 
doi:10.1007/978-3-319-47169-3_17 fatcat:fh3plvzp6za7veg2o4p36jr5jm

Robotic agents capable of natural and safe physical interaction with human co-workers

Michael Beetz, Georg Bartels, Alin Albu-Schaffer, Ferenc Balint-Benczedi, Rico Belder, Daniel Bebler, Sami Haddadin, Alexis Maldonado, Nico Mansfeld, Thiemo Wiedemeyer, Roman Weitschat, Jan-Hendrik Worch
2015 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)  
We show the power of the safety-aware control approach in a real-world scenario with a leading-edge autonomous manipulation platform.  ...  A key requirement for such robotic agents is that they are safety-aware, that is, that they know when actions may hurt or threaten humans and actively refrain from performing them.  ...  model and analyze the properties of dynamical systems.  ... 
doi:10.1109/iros.2015.7354310 dblp:conf/iros/BeetzBABBBHMMWW15 fatcat:7cb5tsw3ofgm3lxrypmupjmwhq

An orchestrated survey of methodologies for automated software test case generation

Saswat Anand, Edmund K. Burke, Tsong Yueh Chen, John Clark, Myra B. Cohen, Wolfgang Grieskamp, Mark Harman, Mary Jean Harrold, Phil McMinn, Antonia Bertolino, J. Jenny Li, Hong Zhu
2013 Journal of Systems and Software  
Test case generation is among the most labour-intensive tasks in software testing and also one that has a strong impact on the effectiveness and efficiency of software testing.  ...  The techniques presented include: (a) structural testing using symbolic execution, (b) model-based testing, (c) combinatorial testing, (d) random testing and its variant of adaptive random testing, and  ...  Symbolic execution is a program analysis technique that analyzes a program's code to automatically generate test data for the program.  ... 
doi:10.1016/j.jss.2013.02.061 fatcat:of7fd2vx3nfmra3yvxvyuqaaa4
« Previous Showing results 1 — 15 out of 14,426 results