Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
398
Over-Approximating Boolean Programs with Unbounded Thread Creation
- In: Formal Methods in Computer-Aided Design (FMCAD), IEEE
, 2006
"... This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting the state of the threads to the globally visible parts, which are finite. Our algorithm models recursion by over-approximating the ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting the state of the threads to the globally visible parts, which are finite. Our algorithm models recursion by over
Verification of Boolean programs with unbounded thread creation
, 2007
"... Most symbolic software model checkers use abstraction techniques to reduce the verification of infinite-state programs to that of decidable classes. Boolean programs [T. Ball, S.K. Rajamani, Bebop: A symbolic model checker for Boolean programs, in: SPIN 00, in: Lecture Notes in Computer Science, vol ..."
Abstract
-
Cited by 9 (7 self)
- Add to MetaCart
, vol. 1885, Springer, 2000, pp. 113–130] are the most popular representation for these abstractions. Unfortunately, today’s symbolic software model checkers are limited to the analysis of sequential programs due to the fact that reachability in Boolean programs with unbounded thread creation
Precise fixpoint-based analysis of programs with thread-creation
- IN PROC. OF CONCUR 2007
, 2007
"... We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of synchronization common in this line of research; it can handle forward as well as backward problems. We exploit a structural p ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of synchronization common in this line of research; it can handle forward as well as backward problems. We exploit a structural
Precise Analysis of Programs with Thread-Creation and Procedures
"... The interest in analysis of parallel programs has increased in recent years. One reason is that popular programming languages, such as Java, provide explicit support for parallelism. Another reason is the routine use of processors with multiple cores even in desktop computers. Most papers on precise ..."
Abstract
- Add to MetaCart
on precise analysis (for references see [1, 2]) use parbegin/parend blocks or their interprocedural counterpart, parallel procedure calls, as a model for parallelism. However, this is not adequate for analyzing languages like Java, because in presence of procedures or methods the thread-creation primitives
A Compilation Framework for Languages with Dynamic Thread Creation
, 1996
"... The efficiency of multithreading is quite essential to the overall performance of concurrent object-oriented languages. It is very inefficient to implement such languages by using thread libraries. In this paper, we propose a framework that efficiently compiles languages which supports dynamic threa ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
thread creation. In the framework, we designed and implemented a programming language Schematic, which is a concurrent object-oriented extension to Scheme. As an intermediate language of Schematic, we are using a subset of process calculus HACL, which is simple but has enough power to express higher
Using the Run-Time Sizes of Data Structures to Guide Parallel-Thread Creation
- IN PROCEEDINGS OF THE ACM CONFERENCE ON LISP AND FUNCTIONAL PROGRAMMING
, 1994
"... Dynamic granularity estimation is a new technique for automatically identifying expressions in functional languages for parallel evaluation. Expressions with little computation relative to thread-creation costs should evaluate sequentially for maximum performance. Static identification of such threa ..."
Abstract
-
Cited by 14 (2 self)
- Add to MetaCart
Dynamic granularity estimation is a new technique for automatically identifying expressions in functional languages for parallel evaluation. Expressions with little computation relative to thread-creation costs should evaluate sequentially for maximum performance. Static identification
Formalization of conflict analysis of programs with procedures, thread creation, and monitors
- THE ARCHIVE OF FORMAL PROOFS. HTTP://AFP.SF.NET/ENTRIES/DISKPAXOS.SHTML
, 2007
"... We study conflict detection for programs with procedures, dynamic thread creation and a fixed finite set of (reentrant) monitors. We show that deciding the existence of a conflict is NP-complete for our model (that abstracts guarded branching by nondeterministic choice) and present a fixpoint-base ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
We study conflict detection for programs with procedures, dynamic thread creation and a fixed finite set of (reentrant) monitors. We show that deciding the existence of a conflict is NP-complete for our model (that abstracts guarded branching by nondeterministic choice) and present a fixpoint
Precise fixed point based analysis of programs with thread-creation
- FACULTY OF INFORMATION TECHNOLOGY, BRNO UNIVERSITY OF TECHNOLOGY
, 2006
"... This paper presents an efficient, fixed point based algorithm for precise kill/gen analysis of interprocedural flow graphs with thread creation. The main idea of the algorithm is to separate a path reaching a control node into those steps required to reach the node and interfering steps, that are e ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
This paper presents an efficient, fixed point based algorithm for precise kill/gen analysis of interprocedural flow graphs with thread creation. The main idea of the algorithm is to separate a path reaching a control node into those steps required to reach the node and interfering steps
Modular Verification of Concurrent Assembly Code with Dynamic Thread Creation and Termination
"... Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly languages, however, can only handle sequential programs. This severely limits their applicability since many real-world sy ..."
Abstract
-
Cited by 22 (8 self)
- Add to MetaCart
is allowed between threads. In this paper, we present a new formal framework for verifying general multi-threaded assembly code with unbounded dynamic thread creation and termination as well as sharing of code between threads. We adapt and generalize the rely-guarantee methodology to the assembly level
Results 1 - 10
of
398
