Filters








342,639 Hits in 1.7 sec

Predicated Generic Functions [chapter]

Jorge Vallejos, Sebastián González, Pascal Costanza, Wolfgang De Meuter, Theo D'Hondt, Kim Mens
2010 Lecture Notes in Computer Science  
This paper presents predicated generic functions, a novel programming language abstraction that allows the expression of contextdependent behaviour in a declarative and modular manner, providing fine-grained  ...  Methods are guarded by predicates with user-defined orderings, thereby increasing the expressiveness of existing method dispatching approaches.  ...  Predicated Generic Functions Predicated generic functions are an extension of the generic function-based mechanism of the Common Lisp Object System (CLOS) [3] .  ... 
doi:10.1007/978-3-642-14046-4_5 fatcat:4mtriid3knhx3ircbaehlw7jyu

Automatic generation of staged geometric predicates

Aleksandar Nanevski, Guy Blelloch, Robert Harper
2001 Proceedings of the sixth ACM SIGPLAN international conference on Functional programming - ICFP '01  
The source language also allows for anonymous functions, and thus enables the common functional programming technique of staging.  ...  A particularly efficient variation on this approach has been used by Shewchuk in his robust implementations of Orient and InSphere geometric predicates.  ...  Of course, this similarity is hard to quantify, if for no other reason than because our predicates are generated in our target language, while Shewchuk's predicates are in C.  ... 
doi:10.1145/507635.507662 dblp:conf/icfp/NanevskiBH01 fatcat:c22prvvug5emfm672ettzabkpm

Automatic generation of staged geometric predicates

Aleksandar Nanevski, Guy Blelloch, Robert Harper
2001 Proceedings of the sixth ACM SIGPLAN international conference on Functional programming - ICFP '01  
The source language also allows for anonymous functions, and thus enables the common functional programming technique of staging.  ...  A particularly efficient variation on this approach has been used by Shewchuk in his robust implementations of Orient and InSphere geometric predicates.  ...  Of course, this similarity is hard to quantify, if for no other reason than because our predicates are generated in our target language, while Shewchuk's predicates are in C.  ... 
doi:10.1145/507660.507662 fatcat:ez7dtribyfga3jqny2dhmu6tzq

Verification Condition Generation for Permission Logics with Abstract Predicates and Abstraction Functions [chapter]

Stefan Heule, Ioannis T. Kassios, Peter Müller, Alexander J. Summers
2013 Lecture Notes in Computer Science  
In this paper, we present an encoding of abstract predicates and abstraction functions in the verification condition generator Boogie.  ...  However, combining abstract predicates and abstraction functions in a verification condition generator leads to subtle interactions, which complicate reasoning about heap modifications.  ...  To prevent matching loops one must refrain from giving recursive definitions to the prover, even though in general the definitions of both predicates and functions can be recursive.  ... 
doi:10.1007/978-3-642-39038-8_19 fatcat:tqhn6lp4nzejvn4bhzsjkv2wli

Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL [chapter]

Jörg Hoffmann, Jan-Georg Smaus, Andrey Rybalchenko, Sebastian Kupferschmid, Andreas Podelski
Lecture Notes in Computer Science  
We show how to use predicate abstraction, in the sense used in model checking, to generate search guidance, in the sense used in Artificial Intelligence (AI).  ...  a list of logical expressions (predicates).  ...  In general, one could use arbitrary expressions; herein, we consider expressions of the form lfn(X) c where lfn(X) is a linear function in variable set X, ∈ {<, ≤, =, ≥, >}, and c is a constant (a number  ... 
doi:10.1007/978-3-540-74128-2_4 fatcat:kcaortt4t5f4rn7omtx5z7cita

Automated test data generation using an iterative relaxation method

Neelam Gupta, Aditya P. Mathur, Mary Lou Soffa
1998 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering - SIGSOFT '98/FSE-6  
Keywords -path testing, dynamic test data generation, predicate slices, input dependency set, predicate residuals, relaxation methods.  ...  In this method, test data generation is initiated with an arbitrarily chosen input from a given domain.  ...  Deriving the Linear Arithmetic Representation of a Predicate Function Given a predicate function and its input dependency set ID for an input I, we write a general linear function of the input variables  ... 
doi:10.1145/288195.288321 dblp:conf/sigsoft/GuptaMS98 fatcat:e47plzz2cfcrlczb4qbfdid6fq

Automated test data generation using an iterative relaxation method

Neelam Gupta, Aditya P. Mathur, Mary Lou Soffa
1998 Software engineering notes  
Keywords -path testing, dynamic test data generation, predicate slices, input dependency set, predicate residuals, relaxation methods.  ...  In this method, test data generation is initiated with an arbitrarily chosen input from a given domain.  ...  Deriving the Linear Arithmetic Representation of a Predicate Function Given a predicate function and its input dependency set ID for an input I, we write a general linear function of the input variables  ... 
doi:10.1145/291252.288321 fatcat:rxzzu7p5fjh7jpl2bxhlsh4sv4

Page 314 of American Mathematical Society. Transactions of the American Mathematical Society Vol. 79, Issue 2 [page]

1955 American Mathematical Society. Transactions of the American Mathematical Society  
KLEENE [July When the primitives are the predicates of the two types of variables general recursive in number-theoretic functions y, - - - , ¥:(*), a predicate P so definable (so definable without use  ...  Thus the class of the allowed primitives can be enlarged to include also the functions general recursive in y;, - - - , ¥.  ... 

Character string predicate based automatic software test data generation

R. Zhao, M.R. Lyu
2003 Third International Conference on Quality Software, 2003. Proceedings.  
This paper presents a novel approach for automatic test data generation of program paths including character string predicates, and the effectiveness of this approach is examined on a number of programs  ...  generated.  ...  Now we explain in detail how to use gradient descent to perform function minimization in order to generate test data for a path including character string predicates.  ... 
doi:10.1109/qsic.2003.1319109 dblp:conf/qsic/ZhaoL03 fatcat:g2ci4hx2yjbpxbmv3w4qyotxva

Page 42 of American Journal of Mathematics Vol. 66, Issue 1 [page]

1944 American Journal of Mathematics  
.* From work of Church and Turing, it appears that any function or predicate which is constructively definable is general recursive.* This lends the general re- cursive functions their chief interest,  ...  while moreover the cursory reader may use it as a principle in verifying our statements that certain functions and predicates are general recursive.  ... 

Recursive Predicates and Quantifiers

S. C. Kleene
1943 Transactions of the American Mathematical Society  
The theorem (Theorem II) is a slight extension of previous results on Herbrand-Gödel general recursive functions(2), while the applications include theorems of Church (Theorem VII)(3) and Gödel (Theorem  ...  The general theorem asserts that to each of an enumeration of predicate forms, there is a predicate not expressible in that form. The predicates considered belong to elementary number theory.  ...  The general theorem on recursive predicates and quantifiers 1 . Primitive recursive functions.  ... 
doi:10.2307/1990131 fatcat:wjmsir4qdzaevoloouubrbvjli

Recursive predicates and quantifiers

S. C. Kleene
1943 Transactions of the American Mathematical Society  
The theorem (Theorem II) is a slight extension of previous results on Herbrand-Gödel general recursive functions(2), while the applications include theorems of Church (Theorem VII)(3) and Gödel (Theorem  ...  The general theorem asserts that to each of an enumeration of predicate forms, there is a predicate not expressible in that form. The predicates considered belong to elementary number theory.  ...  The general theorem on recursive predicates and quantifiers 1 . Primitive recursive functions.  ... 
doi:10.1090/s0002-9947-1943-0007371-8 fatcat:eth5qmjytzhizobcrew5u5qezm

Page 201 of American Mathematical Society. Bulletin of the American Mathematical Society Vol. 61, Issue 3 [page]

1955 American Mathematical Society. Bulletin of the American Mathematical Society  
If we apply to general recursive predicates of number and function variables the operations of the predicate calculus with quantification only of number variables, we get as before arithmetical predicates  ...  More generally there may be several function variables; we shall usually write them a, 8, y, a, - - « , @a, etc.  ... 

Domain testing based on character string predicate [software testing

Zhao, Lyu, Yinghua Min
2003 Proceedings of the 7th International Conference on Properties and Applications of Dielectric Materials (Cat No 03CH37417) ATS-03  
Each character element of variables in a character string predicate is dynamically determined in turn by function minimization so that the ON-OFF test points for the predicate border can be automatically  ...  This paper presents a novel approach to automatically generate ON-OFF test points for character string predicate borders associated with program paths, and describes a corresponding test data generator  ...  We also employ gradient descent to perform function minimization during our ON-OFF test point generation for character string predicate border.  ... 
doi:10.1109/ats.2003.1250790 dblp:conf/ats/ZhaoLM03 fatcat:qfa36fjisndzvdd72kkollr2ea

Indexed Predicate Discovery for Unbounded System Verification [chapter]

Shuvendu K. Lahiri, Randal E. Bryant
2004 Lecture Notes in Computer Science  
For verifying systems with function state variables, which include systems with unbounded memories (microprocessors), arrays in programs, and parameterized systems, an extension to predicate abstraction  ...  Predicate abstraction has been proven effective for verifying several infinite-state systems. In predicate abstraction, an abstract system is automatically constructed given a set of predicates.  ...  To prevent such predicates, we only generate predicates of the form T 1 = T 2 or T 1 < T 2 , where T i is a integer state variable or a function application.  ... 
doi:10.1007/978-3-540-27813-9_11 fatcat:m3ujge5quffcznhfquyt4gesxq
« Previous Showing results 1 — 15 out of 342,639 results