Filters








41,230 Hits in 3.3 sec

Lattice-based SMT for program verification

Karine Even-Mendoza, Antti E. J. Hyvärinen, Hana Chockler, Natasha Sharygina
2019 Proceedings of the 17th ACM-IEEE International Conference on Formal Methods and Models for System Design - MEMOCODE '19  
Our lightweight theory uses lattices for efficient representation of library functions by a subset of guarded literals.  ...  We generalise the method to a number of lattices for functions whose values depend on each other in the program, and we describe a simultaneous traversal algorithm of several lattices, so that a combination  ...  refinement of the theory by the refinement of the set of equations for the library function in the program.  ... 
doi:10.1145/3359986.3361214 dblp:conf/memocode/Even-MendozaHCS19 fatcat:tgyvmy6pgncdha7rhrdvjpb46e

Joining dataflow with predicates

Jeffrey Fischer, Ranjit Jhala, Rupak Majumdar
2005 Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering - ESEC/FSE-13  
Predicate refinement based model checking methods are path-sensitive but must perform many expensive iterations to find all the relevant facts about a program, not all of which are naturally expressed  ...  A predicated lattice partitions the program state according to a set of predicates and tracks a lattice element for each partition.  ...  First, all the relevant information about the program must be expressed as, and reasoned about, using predicates over program variables.  ... 
doi:10.1145/1081706.1081742 dblp:conf/sigsoft/FischerJM05 fatcat:mc6rn4awenf4jgz7p67djrv4bq

Joining dataflow with predicates

Jeffrey Fischer, Ranjit Jhala, Rupak Majumdar
2005 Software engineering notes  
Predicate refinement based model checking methods are path-sensitive but must perform many expensive iterations to find all the relevant facts about a program, not all of which are naturally expressed  ...  A predicated lattice partitions the program state according to a set of predicates and tracks a lattice element for each partition.  ...  First, all the relevant information about the program must be expressed as, and reasoned about, using predicates over program variables.  ... 
doi:10.1145/1095430.1081742 fatcat:rsspgeazv5fy5mybvsp5sto2ei

Automatically identifying C++0x concepts in function templates

Andrew Sutton, Jonathan I. Maletic
2008 2008 IEEE International Conference on Software Maintenance  
The approach can be used to assist in reengineering existing generic libraries to C++0x.  ...  Note that when the refinement hierarchy is instantiated, we also propagate the requirements expressed by each instance to their refinements.  ...  This is used to construct the lattice shown in Figure 6 . The resulting concept lattice provides the means for computing the best requirements for the original function template.  ... 
doi:10.1109/icsm.2008.4658054 dblp:conf/icsm/SuttonM08 fatcat:4awrkxiwdjbqnof26s4ukrdjwq

Incremental Software Construction with Refinement Diagrams [chapter]

Ralph-Johan Back
2006 Lecture Notes in Computer Science  
Program statemens as a latticeProgram statements form a complete lattice with the refinement ordering • Least element is abort • Largest element is magic , defined by wp(magic, Q) = true.  ...  We show a term as a box with dependency arrows, each arrow labeled with a lattice variable. • Example: the term t[t 1 ,t 2 ] is expressed in a refinement diagram as t1 X2 X1 t[X1,X2] t2 • Can also write  ...  Application 6: Requirements as tests • We can consider requirements as specifications that must be refined by their implementations • We can also consider requirements as parts that use the implementations  ... 
doi:10.1007/11784180_1 fatcat:yvqnwkyzbbg4jhm76zfgoegj6m

Joining specification statements

K.Rustan M. Leino, Rajit Manohar
1999 Theoretical Computer Science  
The specification statement allows us to easily express what a program statement does.  ...  This paper shows how refinement of specification statements can be directly expressed using the predicate calculus.  ...  Rick Hehner and the referees pointed us to some related work. Paul Gardiner's suggestion of defining q ' in terms of q and his suggested definition led to our definition of 0'.  ... 
doi:10.1016/s0304-3975(98)00165-0 fatcat:6iyw2cp2rzflhol45bl45gl6si

Relative Completeness of Abstraction Refinement for Software Model Checking [chapter]

Thomas Ball, Andreas Podelski, Sriram K. Rajamani
2002 Lecture Notes in Computer Science  
Intuitively, this means that the use of fixpoint iteration over abstractions and a particular backwards refinement of the abstractions has the effect of exploring the entire state space of all possible  ...  Automated methods for an undecidable class of verification problems cannot be complete (terminate for every correct program).  ...  Our setting of the lattice L(P) generalizes the setting of Boolean expressions that has been used so far in work on abstract model checking [1, 2, 7, 9, 14, 16, 17, 25, 26, 27, 28, 29] .  ... 
doi:10.1007/3-540-46002-0_12 fatcat:pxgyyl4kkfgltgauwalxwlzrjq

Information Flow Control-by-Construction for an Object-Oriented Language Using Type Modifiers [article]

Tobias Runge, Alexander Kittelmann, Marco Servetto, Alex Potanin, Ina Schaefer
2022 arXiv   pre-print
We introduce IFbCOO, an approach that guides users incrementally to a secure implementation by using refinement rules.  ...  In each refinement step, confidentiality or integrity (or both) is guaranteed alongside the functional correctness of the program, such that insecure programs are declined by construction.  ...  An abstract expression that requires a security level s can be weakened to require a security level s if the expression is capsule or imm.  ... 
arXiv:2208.02672v1 fatcat:owf6bwacynhj7imrjjkuhkadhm

Scheduling in the Z-Polyhedral Model

Gautam, DaeGon Kim, S. Rajopadhye
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
The model, however, is limited in expressivity and the need for the generalization to more general class of programs has been widely known.  ...  The resultant schedule can then be used to construct a space-time transformation to obtain an equivalent program in the Z-polyhedral model.  ...  (i →) Let the two branches of the expression be denoted by X and Y respectively. Next, we will study a refinement on this RDG.  ... 
doi:10.1109/ipdps.2007.370229 dblp:conf/ipps/GuptaKR07 fatcat:rysz7qpumjb5hn24d5f22qwp3m

Frame rule for mutually recursive procedures manipulating pointers

Viorel Preoteasa
2009 Theoretical Computer Science  
Using a predicate transformer semantics of programs, we introduce statements for heap operations and separation logic operators for specifying programs that manipulate pointers.  ...  In this implementation program variables and addresses can store values of almost any type of the theorem prover.  ...  Acknowledgments We thank Carsten Varming and Lars Birkedal for the discussion about their work on higher-order separation logic and the anonymous referees for their useful comments and suggestions which  ... 
doi:10.1016/j.tcs.2009.05.016 fatcat:34wxxjeuyffwfjzm6u7u5yx3oa

Formal Concept Analysis for Knowledge Refinement in Case Based Reasoning [chapter]

Belén Díaz-Agudo, Marco A. Gómez-Martín, Pedro P. Gómez-Martín, Pedro A. González-Calero
2006 Research and Development in Intelligent Systems XXII  
In this paper we propose the use of Formal Concept Analysis (FCA) to acquire and refine the knowledge available in a CBR system.  ...  Although CBR is supposed to alleviate the problem of knowledge acquisition, knowledge is still required to obtain the initial case base and to develop the processes of retrieving, reusing, revising and  ...  We have used FCA to acquire and refine the knowledge available in a CBR system.  ... 
doi:10.1007/978-1-84628-226-3_18 dblp:conf/sgai/Diaz-AgudoGGG05 fatcat:fdt5iv6lsrdklcnvp657jkl2wi

Practical Probability: Applying pGCL to Lattice Scheduling [chapter]

David Cock
2013 Lecture Notes in Computer Science  
Building on our published mechanisation of the probabilistic program logic pGCL we present a verified lattice scheduler, a standard covert-channel mitigation technique, employing randomisation as an elegant  ...  The refinement framework employed is compatible with that used in the L4.verified project, supporting our argument that full-scale verification of probabilistic security properties for realistic systems  ...  NICTA is funded by the Australian Government as represented by the Department of Broadband, Communications and the Digital Economy and the Australian Research Council through the ICT Centre of Excellence program  ... 
doi:10.1007/978-3-642-39634-2_23 fatcat:a56tpm2apbdjbmf3nct6yoyj2a

A unifying view of abstract domain design

Gilberto Filé, Roberto Giacobazzi, Francesco Ranzato
1996 ACM Computing Surveys  
Enhancing and simplifying operators are viewed, respectively, as domain refinements and inverses of domain refinements.  ...  The concept of abstract interpretation has been introduced by Patrick and Radhia Cousot in [4, 5] , in order to formalize static program analyses.  ...  Refinements could be a basis for an environment for developing expressive abstract domains.  ... 
doi:10.1145/234528.234742 fatcat:glx3x6ghfbgqtmcwrdppzqyqgi

Finding suitable programs: Semantic search with incomplete and lightweight specifications

Kathryn T. Stolee
2012 2012 34th International Conference on Software Engineering (ICSE)  
The repository of programs is automatically encoded offline so the search for matching programs is efficient.  ...  On the other hand, a semantic search may return relevant results, but current techniques require developers to write specifications by hand, are costly as potentially matching code need to be executed  ...  We recognize that using lattices to relax matching criteria is similar in spirit to the pre/postcondition lattices used in previous work [4] [5] .  ... 
doi:10.1109/icse.2012.6227034 dblp:conf/icse/Stolee12 fatcat:vmeclvfrnzf47m5k4zgp66ttua

A study of second-order thermal diffuse X-ray scattering effects and the elastic properties of cubic single crystals

B. W. Lucas
1970 Acta Crystallographica Section A  
The refinement was simplified by equating two functions, each depending on the elastic properties of the crystal, the nearby lattice point to the positions of observation and the direction along which  ...  A method has been given which allows for second-order contributions to the total diffuse intensity by use of a least-squares procedure.  ...  Table 1 . 1 Expressions for A corresponding to the major 110 101 011 2 2 3) in the refinement program, select and calculate the appropriate A value by specifying [ABC], (hkl) and approximate  ... 
doi:10.1107/s0567739470000840 fatcat:ohkq4cyfkngurfzl7byaquwobu
« Previous Showing results 1 — 15 out of 41,230 results