Filters








20,470 Hits in 8.9 sec

Solving Boolean Combinations of Nonlinear Numerical Constraints

Xiao-Hui JI
2005 Journal of Software (Chinese)  
Many existing methods for solving such constraints are incomplete. A new method is presented in this paper to solve Boolean combinations of nonlinear numerical constraints completely.  ...  Constraints involving Boolean and numerical variables are used widely, but it is difficult to solve especially when they contain nonlinear numerical expressions.  ...  In the analysis of state-based requirement specifications and in software test data generation, such constraints also need to be processed [1, 2] .  ... 
doi:10.1360/jos160659 fatcat:woi5fm6ojze4hj7zlj7al35cfe

A CONSTRAINT SOLVER AND ITS APPLICATION TO PATH FEASIBILITY ANALYSIS

JIAN ZHANG, XIAOXU WANG
2001 International journal of software engineering and knowledge engineering  
The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package.  ...  Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints.  ...  Acknowledgements The authors would like to thank the anonymous reviewers for careful reading of an earlier draft and for their suggestions.  ... 
doi:10.1142/s0218194001000487 fatcat:agjlvjrt45cmph7qnh2dcnk5uq

Functional Test Generation Using Constraint Logic Programming [chapter]

Zhihong Zeng, Maciej Ciesielski, Bruno Rouzeyre
2002 IFIP Advances in Information and Communication Technology  
The generation of functional test vectors, guided by miscellaneous coverage metrics to satisfy the simulation target, can be posed as a satisfiability problem (SAT).  ...  This paper presents a novel approach to solving SAT based on Constraint Logic Programming technique.  ...  constraint-solving technique are combined to solve SAT problems.  ... 
doi:10.1007/978-0-387-35597-9_32 fatcat:uhmy4a7uxrgbnj2tq2eaiepclq

Verifying and Synthesizing Software with Recursive Functions [chapter]

Viktor Kuncak
2014 Lecture Notes in Computer Science  
We develop tools and algorithms that span static and dynamic verification, constraint solving, and program synthesis.  ...  functions, and the framework of complete functional synthesis.  ...  [17] , and that connects the area of verification to numerical analysis and to decision procedures for theories of real numbers [21] .  ... 
doi:10.1007/978-3-662-43948-7_2 fatcat:juvxexoa7zb7vklmkpl2nfqj5q

Abstracts of Current Computer Literature

1969 IEEE transactions on computers  
Time consuming numerical calculations are replaced by logical operations and storage of terms is limited to minterms and prime implicants. 6895 Unateness Test of a Boolean Function and Two General Synthesis  ...  Such techniques are used and, in addition, data references are represented in a nondirected model. The complete structural specification of a program is represented by a combined model.  ... 
doi:10.1109/t-c.1969.222770 fatcat:3u7q7ac3b5hx5fdffcemcrpsay

Numerical LTL Synthesis for Cyber-Physical Systems [article]

Chih-Hong Cheng, Edward A. Lee
2013 arXiv   pre-print
Our core methodology, called numerical LTL synthesis, extends LTL synthesis by using inputs or outputs in real numbers and by allowing predicates of polynomial constraints to be defined within an LTL formula  ...  to specifications having a few discrete inputs within the Boolean domain.  ...  The first algorithm translates the corresponding Büchi automaton of a given specification to a Büchi game and generates the controller via Büchi game solving.  ... 
arXiv:1307.3722v1 fatcat:4xmi5mxsznhgpfbj2wxr3t4rve

Low-Rank Boolean Matrix Approximation by Integer Programming [article]

Reka Kovacs, Oktay Gunluk, Raphael Hauser
2018 arXiv   pre-print
and report numerical tests on synthetic and real-world data.  ...  Low-rank approximations of data matrices are an important dimensionality reduction tool in machine learning and regression analysis.  ...  Computational Experiments In this section we report numerical tests of the model (BP) on artificial and real-world datasets.  ... 
arXiv:1803.04825v1 fatcat:lxmgalwjuzd5djpx2rdpp3ew6u

An efficient finite-domain constraint solver for circuits

G. Parthasarathy, M. K. Iyer, K.-T. Cheng, L.-C. Wang
2004 Proceedings of the 41st annual conference on Design automation - DAC '04  
This enables efficient combination of Boolean SAT and linear integer arithmetic solving techniques. We automatically use control and data-path abstraction in RTL descriptions.  ...  We describe how DPLL search is modified for search in combined integer and Boolean domains by using efficient finite-domain constraint propagation.  ...  INTRODUCTION Numerous electronic design automation (EDA) problems can be efficiently represented by a combination of Boolean and integer constraints -like formal verification and functional test generation  ... 
doi:10.1145/996566.996628 dblp:conf/dac/ParthasarathyICW04 fatcat:ex2exwy4hbdrdovdxlu5kf5yom

URSA: A System for Uniform Reduction to SAT

Predrag Janicic, Toby Walsh
2012 Logical Methods in Computer Science  
The system uses a new specification language URSA that combines imperative and declarative programming paradigms.  ...  So, the system can be seen not only as a tool for solving problems by reducing them to SAT, but also as a general-purpose constraint solving system (for finite domains).  ...  Acknowledgement This work was partially supported by the Serbian Ministry of Science grant 174021 and by SNF grant SCOPES IZ73Z0 127979/1.  ... 
doi:10.2168/lmcs-8(3:30)2012 fatcat:eq5sfa5mhvakph53wxl6m4pkxy

Combining Model Checking and Symbolic Execution for Software Testing [chapter]

Corina S. Păsăreanu
2012 Lecture Notes in Computer Science  
=hash(X) S4 S3 S4 PC: X>0 & Y=hash(X) PC: X>3 & Y>10 & Y=hash(X) & Y=hash(X) PC: X>0 & X<=3 Solve x>0 hash(1)=10 check x>0 & y=10 S0 Generation and Solving of Numeric Constraints if( (pres < pres_min)  ...  specifications Testing the Onboard Abort Executive (OAE) Generated Test Cases and Constraints Polyglot Test Generation for TTEthernet Protocol Polyglot Prototype for CEV ascent abort handling being developed  ... 
doi:10.1007/978-3-642-30473-6_2 fatcat:l4hkrwpqgja4xmab6cya2ex4nu

Constraints as control

Ali Sinan Köksal, Viktor Kuncak, Philippe Suter
2012 SIGPLAN notices  
We evaluate Kaplan on examples ranging from enumeration of data structures to execution of declarative specifications.  ...  Kaplan integrates constraint and imperative programming by using constraints as an advanced control structure; the developers use the monadic 'for' construct to iterate over the solutions of constraints  ...  Acknowledgments We thank Sergio Antoy for an interesting discussion on the status of the Curry programming language.  ... 
doi:10.1145/2103621.2103675 fatcat:ktkco3x6mjgzbbyrjpxcjwsf5q

Constraints as control

Ali Sinan Köksal, Viktor Kuncak, Philippe Suter
2012 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '12  
We evaluate Kaplan on examples ranging from enumeration of data structures to execution of declarative specifications.  ...  Kaplan integrates constraint and imperative programming by using constraints as an advanced control structure; the developers use the monadic 'for' construct to iterate over the solutions of constraints  ...  Acknowledgments We thank Sergio Antoy for an interesting discussion on the status of the Curry programming language.  ... 
doi:10.1145/2103656.2103675 dblp:conf/popl/KoksalKS12 fatcat:cckhatpxnnhmpghi6p7lxjowgy

Automatic and efficient simulation of operation contracts

Matthias P. Krieger, Alexander Knapp, Burkhart Wolff
2011 SIGPLAN notices  
In this paper we deal with the problem of operation contract simulation, i.e., determining operation results satisfying the postconditions based on input data supplied by the user; simulating operation  ...  Operation contracts consisting of pre-and postconditions are a well-known means of specifying operations.  ...  Final constraint solving is performed by encoding the constraints as a Boolean formula and calling an off-the-shelf SAT solver.  ... 
doi:10.1145/1942788.1868303 fatcat:ldleigiryvbexmric3vyj4minq

Towards Verified Artificial Intelligence [article]

Sanjit A. Seshia, Dorsa Sadigh, S. Shankar Sastry
2020 arXiv   pre-print
We describe five challenges for achieving Verified AI, and five corresponding principles for addressing these challenges.  ...  Verified artificial intelligence (AI) is the goal of designing AI-based systems that that have strong, ideally provable, assurances of correctness with respect to mathematically-specified requirements.  ...  Research Center, one of six centers supported by the STARnet phase of the Focus Center Research Program (FCRP) a Semiconductor Research Corporation program sponsored by MARCO and DARPA, by the DARPA BRASS  ... 
arXiv:1606.08514v4 fatcat:ozoldsdnzjghddhwz5xju6zqvu

Improving Test Generation under Rich Contracts by Tight Bounds and Incremental SAT Solving

Pablo Abad, Nazareno Aguirre, Valeria Bengolea, Daniel Ciolek, Marcelo F. Frias, Juan Galeotti, Tom Maibaum, Mariano Moscato, Nicolas Rosner, Ignacio Vissani
2013 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation  
We present a novel and general technique for automated test generation that combines tight bounds with incremental SAT solving.  ...  As our experimental results show, the combination of tight bounds with incremental SAT, and the testing criterion driven approach implemented in our prototype tool FAJITA, enable us to effectively generate  ...  This work was partially supported by the Argentinian Agency for Scientific and Technological Promotion (ANPCyT), through grants PICT PAE 2007 No. 2772 and PICT 2010 No. 1690, and by the MEALS project  ... 
doi:10.1109/icst.2013.46 dblp:conf/icst/AbadABCFGMMRV13 fatcat:qo5zbj6htfeutdsmqcvcff6g5u
« Previous Showing results 1 — 15 out of 20,470 results