Filters








849,199 Hits in 7.6 sec

Properties of the working-set model

Peter J. Denning, Stuart C. Schwartz
1972 Communications of the ACM  
A program's working set W(t, T) at time t is the set of distinct pages among the T most recently referenced pages.  ...  The independent-reference model, in which page references are statistically independent, is used to assess the effects of interpage dependencies on working-set size observations.  ...  The working-set model for program behavior [6, 7] has proved to be a useful starting point.  ... 
doi:10.1145/361268.361281 fatcat:4crqagpbzvgtpbqcohueko5j2a

Properties of the working-set model

Peter J. Denning, Stuart C. Schwartz
1971 Proceedings of the third symposium on Operating systems principles - SOSP '71  
A program's working set W(t, T) at time t is the set of distinct pages among the T most recently referenced pages.  ...  The independent-reference model, in which page references are statistically independent, is used to assess the effects of interpage dependencies on working-set size observations.  ...  The working-set model for program behavior [6, 7] has proved to be a useful starting point.  ... 
doi:10.1145/800212.806511 dblp:conf/sosp/DenningS71 fatcat:qlv5zqx6ezggzdagyrfsiqd6y4

Properties of the working-set model

Peter J. Denning, Stuart C. Schwartz
1972 ACM SIGOPS Operating Systems Review  
A program's working set W(t, T) at time t is the set of distinct pages among the T most recently referenced pages.  ...  The independent-reference model, in which page references are statistically independent, is used to assess the effects of interpage dependencies on working-set size observations.  ...  The working-set model for program behavior [6, 7] has proved to be a useful starting point.  ... 
doi:10.1145/850614.850639 fatcat:54d7ys7d7vc67iszrzn6zs46pi

Abstract abstract reduction

Georg Struth
2006 The Journal of Logic and Algebraic Programming  
We are not able to prove some further fundamental statements: roughly, our algebras model the (ω-)regular, but not the context-free part of abstract rewriting.  ...  Section 2 introduces Kleene algebra and ω-algebra; Section 3 recalls some of their basic properties. Section 4 connects these algebras with abstract reduction and the associated diagrammatic proofs.  ...  In particular I am indebted to one of the referees for communicating his proof experiments in Kleene algebra with the Otter theorem prover.  ... 
doi:10.1016/j.jlap.2005.04.001 fatcat:sb642bhnqnanrohtc3cgcmwmb4

Applying Predicate Abstraction to Abstract State Machines [chapter]

Alessandro Bianchi, Sebastiano Pizzutilo, Gennaro Vessio
2015 Lecture Notes in Business Information Processing  
Since the notion of ASM state naturally captures the classic notion of program state, ASMs are suitable to be verified through a predicate abstraction approach.  ...  The aim of this paper is to discuss how predicates over ASM states can support the formal verification of ASM-based models.  ...  Acknowledgements This work has been partially funded by the Italian Ministry of Education, University and Research, within the "Piano Operativo Nazionale" PON02_00563_3489339.  ... 
doi:10.1007/978-3-319-19237-6_18 fatcat:srddlt35sbhr5f5a7k6j7say2q

Applying Predicate Abstraction to Abstract State Machines [chapter]

Alessandro Bianchi, Sebastiano Pizzutilo, Gennaro Vessio
2015 Lecture Notes in Business Information Processing  
Since the notion of ASM state naturally captures the classic notion of program state, ASMs are suitable to be verified through a predicate abstraction approach.  ...  The aim of this paper is to discuss how predicates over ASM states can support the formal verification of ASM-based models.  ...  Acknowledgements This work has been partially funded by the Italian Ministry of Education, University and Research, within the "Piano Operativo Nazionale" PON02_00563_3489339.  ... 
doi:10.1007/978-3-319-19237-6_30 fatcat:obue3uoeqbctfbajlzvt2x54lq

Abstract Counterexamples for Non-disjunctive Abstractions [chapter]

Kenneth L. McMillan, Lenore D. Zuck
2009 Lecture Notes in Computer Science  
The method is commonly used, for example in selecting predicates for predicate abstraction.  ...  Counterexample-guided abstraction refinement (CEGAR) is an important method for tuning abstractions to properties to be verified.  ...  We can think of a state formula φ as representing a set of states, namely, the set of first-order models of φ.  ... 
doi:10.1007/978-3-642-04420-5_17 fatcat:4g3zekdpxjg2lhmxq63jk6mo6i

Abstracting abstract control

James Ian Johnson, David Van Horn
2014 SIGPLAN notices  
We revise the abstracting abstract machines technique to target the stronger computational model of pushdown systems. In place of automata theory, we use only abstract machines and memoization.  ...  Such a model is inherently imprecise when it comes to reasoning about the control stack of the interpreter: a finite state machine cannot faithfully represent a stack.  ...  Additionally, the algorithms employed in these works expect a complete description of the model up front, rather than work with a modified step function (also called post), such as in "on-the-fly" model-checking  ... 
doi:10.1145/2775052.2661098 fatcat:esp7bav7hjfdfmzgmeicsk5aqi

Abstracting abstract control

James Ian Johnson, David Van Horn
2014 Proceedings of the 10th ACM Symposium on Dynamic languages - DLS '14  
We revise the abstracting abstract machines technique to target the stronger computational model of pushdown systems. In place of automata theory, we use only abstract machines and memoization.  ...  The "abstracting abstract machines" (AAM) approach to constructing static analyses has recently been proposed as a method to ameliorate the difficulty of designing analyses for such language features.  ...  Additionally, the algorithms employed in these works expect a complete description of the model up front, rather than work with a modified step function (also called post), such as in "on-the-fly" model-checking  ... 
doi:10.1145/2661088.2661098 dblp:conf/dls/JohnsonH14 fatcat:jftogwomxjhs3ob62mihglncom

Abstract Threads [chapter]

Shuvendu K. Lahiri, Alexander Malkis, Shaz Qadeer
2010 Lecture Notes in Computer Science  
The new approach extends thread-modular reasoning by relaxing the structure of the transition relation of a specification.  ...  The checks on whether specifications of threads are sound as well as whether the composition of the specifications is error-free are handed over to the off-the-shelf verifiers.  ...  We also introduce a map variable F : N → Boolean to model the set of locations of the abstract thread.  ... 
doi:10.1007/978-3-642-11319-2_18 fatcat:sd46jyjjgzdn5hf4lw7bbhpufq

Abstracts

1977 IBM Systems Journal  
Most of the work either as- sumes the existence of a reference string or attempts to produce a model for the process by which these reference strings are generated.  ...  Models developed from these analyses have application to the validation of proposed data base subsystem models. ABSTRACTS 201  ... 
doi:10.1147/sj.162.0198 fatcat:gaqypdlel5cc3b23h7zi3ofuby

Abstract Modularity [chapter]

Michael Abbott, Neil Ghani, Christoph Lüth
2005 Lecture Notes in Computer Science  
Research has typically focused on reasoning about the modularity of specific properties for specific ways of combining specific forms of rewriting.  ...  This paper is, we believe, the first to ask a much more general question. Namely, what can be said about modularity independently of the specific form of rewriting, combination and property at hand.  ...  Abstract Rewriting A monad on Set builds a set of terms from a set of variables.  ... 
doi:10.1007/978-3-540-32033-3_5 fatcat:4q2eamf54retlnlmk2azxuorn4

Abstracts

2000 Publications of the Modern Language Association of America  
In setting his 1898 tale In the Cage in a telegraph office, Henry James was adapting and investigating a metaphor that earlier novelists had used for the workings of fiction.  ...  As invoked by writers such as Elizabeth Gaskell and Charles Dickens, the idealized image of the electric telegraph hints at some of the formal and ideological properties of Victorian realism.  ... 
doi:10.1632/s0030812900166659 fatcat:thnc7el5g5gspdfxxvuuxt2z3m

PhD Abstracts

GRAHAM HUTTON
2019 Journal of functional programming  
As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year.  ...  properties, models, and specifications.  ...  Finding properties of programs We develop a tool for finding properties of sets of concurrency functions operating on some shared state, such as the API for a concurrent data type.  ... 
doi:10.1017/s0956796819000078 fatcat:nqlt4e66r5ea5ibvngbewqpvs4

Abstraction abstracted

Russ Abbott, Chengyu Sun
2008 Proceedings of the 2nd international workshop on The role of abstraction in software engineering - ROA '08  
An abstraction is the reification of and conceptualization of a distinction. We use the process of forming abstractions to make sense of the world, i.e., to form concepts.  ...  We can teach the use of pre-packaged abstractions. It is more difficult to teach the self-awareness necessary for inventing new abstractions. The process of building abstractions is bottom-up.  ...  The irresistible beauty of programming consists in the reduction of complex formal processes to a very small set of primitive operations.  ... 
doi:10.1145/1370164.1370171 fatcat:2775m7jphnh25f7sfnj6dkjema
« Previous Showing results 1 — 15 out of 849,199 results