Filters








47,422 Hits in 6.0 sec

Page 6951 of Mathematical Reviews Vol. , Issue 95k [page]

1995 Mathematical Reviews  
For example there is a counterex- ample to modularity of rule systems that are non-self-embedding (a property which implies termination).  ...  A program consists of a set of rewrite rules of the form L— R.  ... 

A Modular Checker for Multithreaded Programs [chapter]

Cormac Flanagan, Shaz Qadeer, Sanjit A. Seshia
2002 Lecture Notes in Computer Science  
To handle realistic programs, Calvin performs modular checking of each procedure called by a thread using specifications of other procedures and other threads.  ...  The checker leverages off existing sequential program verification techniques based on automatic theorem proving. To evaluate the checker, we have applied it to several real-world programs.  ...  A standard notion of modularity for sequential programs is procedure-modular reasoning [17] , where a call site of a procedure is analyzed using a precondition/postcondition specification of that procedure  ... 
doi:10.1007/3-540-45657-0_14 fatcat:mlqijrukbreereaij3ujjawnrm

A modular, prospective, semi-automated drug safety monitoring system for use in a distributed data environment

Joshua J. Gagne, Shirley V. Wang, Jeremy A. Rassen, Sebastian Schneeweiss
2014 Pharmacoepidemiology and Drug Safety  
of a sequential alerting algorithm.  ...  Methods We built a modular program that semi-automatically performs cohort identification, confounding adjustment, diagnostic checks, aggregation and effect estimation across multiple databases, and application  ...  ACKNOWLEDGEMENTS Funded by grants from the National Library of Medicine (R01-LM010213; RC1-LM010351), the National Center for Research Resources (RC1-RR028231), and the National Heart Lung and Blood Institute  ... 
doi:10.1002/pds.3616 pmid:24788694 pmcid:PMC4159708 fatcat:wiin64k45fd2rhor6vlrzgpnfy

Modular reasoning about concurrent higher-order imperative programs

Lars Birkedal
2014 Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '14  
To reason about higher-order imperative programs, we introduced nested triples. These features facilitate modular reasoning about sequential higher-order programs with limited forms of sharing.  ...  For modularity, we use higher-order quantification over so-called impredicative protocols. To show soundness of the logic we build a non-trivial model using guarded recursion.  ... 
doi:10.1145/2535838.2537849 dblp:conf/popl/Birkedal14 fatcat:hjgtj3khsfg2zk766px2gexvaq

Foreword

Giorgio Levi, Mario Rodriguez-Artalejo
1996 Theoretical Computer Science  
A sequential reduction strategy) by Sergio Antoy and Aart Middeldorp, gives a new sequential reduction strategy which is normalizing for a wide class of TRSs, and allows to detect some non-terminating  ...  ; and extensions of logic programming.  ...  A sequential reduction strategy) by Sergio Antoy and Aart Middeldorp, gives a new sequential reduction strategy which is normalizing for a wide class of TRSs, and allows to detect some non-terminating  ... 
doi:10.1016/s0304-3975(96)90229-7 fatcat:vsbnpem6afhhncb4uiysbzv2vm

Capsule-Oriented Programming

Hridesh Rajan
2015 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering  
What if the programming model enabled programmers to simply do what they do best, that is, to describe a system in terms of its modular structure and write sequential code to implement the operations of  ...  This model favors modularity over explicit concurrency, encourages concurrency correctness by construction, and exploits modular structure of programs to expose implicit concurrency.  ...  A central goal of capsule-oriented programming is to provide tools to enable programmers to simply do what they do best, that is, to describe a system in terms of its modular structure and write sequential  ... 
doi:10.1109/icse.2015.205 dblp:conf/icse/Rajan15 fatcat:x2py4stlezcq5amatejv7ikqlm

Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions [chapter]

Raphaël Monat, Antoine Miné
2017 Lecture Notes in Computer Science  
The analysis is sound (assuming a sequentially consistent memory), parameterized by a choice of abstract domains and, in order to scale up, it is modular, in that it iterates over each thread individually  ...  We present a static analysis by abstract interpretation of numeric properties in multi-threaded programs.  ...  We show how we can use existing numeric abstract domains used in the analysis of sequential programs to abstract our concrete thread-modular analysis.  ... 
doi:10.1007/978-3-319-52234-0_21 fatcat:mghcniaftnclfnssz6qhcwvujq

Aspect Oriented Parallel Framework for Java [chapter]

Bruno Medeiros, João L. Sobral
2017 Lecture Notes in Computer Science  
Aspects address the complexity of parallel programs by enabling the composition of (multiple) parallelism modules with a given (sequential) base program.  ...  This paper introduces aspect libraries, a unit of modularity in parallel programs with compositional properties.  ...  In contrast, a non-modular design requires invasive changes to the base program (e.g. Figure 1 ). The MD case study scales well with the number of cores.  ... 
doi:10.1007/978-3-319-61982-8_20 fatcat:e5ijnniyp5hutb7pd2qujuqmwa

Modularity vs. Reusability: Code Generation from Synchronous Block Diagrams

Roberto Lublinerman, Stavros Tripakis
2008 2008 Design, Automation and Test in Europe  
The main trade-off is the degree of modularity (number of interface functions) vs. reusability (the set of diagrams that the block can be used in without creating dependency cycles). * We would like to  ...  We present several methods to generate modular code from synchronous hierarchical block diagrams.  ...  The profile of a block A contains: (1) The type of A: whether A is combinational, Mooresequential or non-Moore sequential.  ... 
doi:10.1109/date.2008.4484887 dblp:conf/date/LublinermanT08 fatcat:uk3jq4244zewvdzoccckyliwbm

Modularity vs. reusability

Roberto Lublinerman, Stavros Tripakis
2008 Proceedings of the conference on Design, automation and test in Europe - DATE '08  
The main trade-off is the degree of modularity (number of interface functions) vs. reusability (the set of diagrams that the block can be used in without creating dependency cycles). * We would like to  ...  We present several methods to generate modular code from synchronous hierarchical block diagrams.  ...  The profile of a block A contains: (1) The type of A: whether A is combinational, Mooresequential or non-Moore sequential.  ... 
doi:10.1145/1403375.1403736 fatcat:2qqqxo2x6feixifmwjcw2xgxhq

Practical proofs of concurrent programs

Marc Shapiro
2006 SIGPLAN notices  
In addition to the standard pre-and postconditions of sequential Hoare logic, a program is equipped with a non-interference assertions: a rely condition limits the interference it may suffer from its environment  ...  More and more developers will be seduced into concurrent programming, unprepared for the difficulties of understanding, writing and debugging concurrent programs.  ...  In addition to the standard pre-and postconditions of sequential Hoare logic, a program is equipped with a non-interference assertions: a rely condition limits the interference it may suffer from its environment  ... 
doi:10.1145/1160074.1159819 fatcat:75mbz5g55bgercqh6tee7hn7re

Modular Verification of Concurrent Programs via Sequential Model Checking [article]

Dan Rasin, Orna Grumberg, Sharon Shoham
2021 arXiv   pre-print
We reduce the verification of a concurrent program to a series of verification tasks of sequential programs.  ...  This work utilizes the plethora of work on verification of sequential programs for the purpose of verifying concurrent programs.  ...  of sequential programs.  ... 
arXiv:2106.00732v1 fatcat:am32pz3ei5ctboji5vi2g2qeai

Modular model building [article]

Aneil Mallavarapu, Matthew Thomson, Benjamin Ullian, Jeremy Gunawardena
2007 arXiv   pre-print
These in turn require models to be represented as programs rather than as datatypes.  ...  Overcoming this requires modularity, enabling sub-systems to be specified independently and combined incrementally, and abstraction, enabling general properties to be specified independently of specific  ...  We thank Carl Pabo, Brian Seed and Rebecca Ward for their insightful comments and the other members of the Virtual Cell Program for their assistance.  ... 
arXiv:0710.3421v1 fatcat:xez7wvmt7vhivfc4xfu7tjokie

Thread-Modular Verification for Shared-Memory Programs [chapter]

Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
2002 Lecture Notes in Computer Science  
Using this environment assumption, the checker reduces the verification of the original multithreaded program to the verification of several sequential programs, one for each thread.  ...  These sequential programs are subsequently analyzed using extended static checking techniques (based on verification conditions and automatic theorem proving).  ...  checker is based; and Sanjit Seshia for helping with the implementation of the checker.  ... 
doi:10.1007/3-540-45927-8_19 fatcat:2ohfnz3vzzavtdwdcy4duszc4e

Reconciling concurrency and modularity with Panini's asynchronous typed events

Yuheng Long, Hridesh Rajan, Sean L. Mooney
2010 Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion - SPLASH '10  
It focuses on Pānini's asynchronous, typed event which reconciles the modularity goal promoted by the implicit invocation design style with the scalability goal of exposing concurrency between the execution  ...  of subjects and observers.  ...  This avoids any threat of incorrect or non-deterministic concurrency, thus allowing programmers to concentrate on creating a good, maintainable modular design.  ... 
doi:10.1145/1869542.1869595 dblp:conf/oopsla/LongRM10 fatcat:x3guvecgjbfvpb2eger4fi7pkm
« Previous Showing results 1 — 15 out of 47,422 results