Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
466
Incremental Type-Checking in Z
, 1992
"... Over the last decade, formal methods have become progressively more widely used to counteract the problems of software development. Nowadays, a relatively large number of formal methods, or notations, are available and Z is one of the most widely used. However, Z is not so widespread in the industri ..."
Abstract
- Add to MetaCart
in the industrial community as it is in the academic one. The provision of automated tools, such as syntax checkers and type checkers, is essential to the successful application of Z on industrial scale problems. The use of these tools during the software specification phase reduces the possibility of errors
4] Pierre-Louis Curien and Giorgio Ghelli. Coherence of subsumption, minimum typing and type-checking
- IEEE Transactions on Power Systems
, 2003
"... Abstract—System splitting problem, also known as controlled system separation problem, is to determine the proper splitting points for splitting the entire power network into islands when island operation of system is unavoidable. By “proper ” we mean that the splitting strategies should guarantee b ..."
Abstract
-
Cited by 11 (1 self)
- Add to MetaCart
splitting strategies in real-time. The method narrows down the strategy space using highly efficient OBDD-based algorithm in the first phase, then finds proper splitting strategies using power-flow analysis in the reduced strategy space in the second phase. Simulation with symbolic model checking tool SMV
Automated Consistency Checking of Requirements Specifications
, 1996
"... This paper describes a formal analysis technique, called consistency checking, for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed i ..."
Abstract
-
Cited by 270 (33 self)
- Add to MetaCart
This paper describes a formal analysis technique, called consistency checking, for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed
Fast Structural Type Equivalence and Inclusion Testing or Debunking the "Expensive Structural Types" Myth or Unimaginative Comparative Language Texts Considered Harmful
"... Structural type equivalence is the notion that two type expressions are equivalent iff they describe equivalently structured data. Name equivalence, by contrast, considers two types equivalent only when they are defined by the same textual occurrence of a type expression. Consequently, structural eq ..."
Abstract
- Add to MetaCart
equivalence is more flexible than name equivalence. Unfortunately, it is commonly considered to be more expensive to support structural equivalence in the type checking phase of statically typed programmming languages. I contend that this reputation is undeserved. Specifically, I demonstrate that by viewing
Type-Directed, Whitespace-Delimited Parsing for Embedded DSLs
"... Domain-specific languages improve ease-of-use, expressiveness and verifiability, but defining and using different DSLs within a single application remains difficult. We introduce an approach for embedded DSLs where 1) whitespace delimits DSL-governed blocks, and 2) the parsing and type checking phas ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Domain-specific languages improve ease-of-use, expressiveness and verifiability, but defining and using different DSLs within a single application remains difficult. We introduce an approach for embedded DSLs where 1) whitespace delimits DSL-governed blocks, and 2) the parsing and type checking
Higher-Order Modules and the Phase Distinction
- In Seventeenth ACM Symposium on Principles of Programming Languages
, 1990
"... Typed λ-calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their relation to each other. In earlier work we introduced a predicative function calculus, XML, for modeling several ..."
Abstract
-
Cited by 136 (25 self)
- Add to MetaCart
system of ML could be naturally extended to higher orders. However, whereas ML maintains a clear distinction between compile-time and run-time in both its implementation and formal semantics, the XML calculus blurs this distinction. Since static type checking is, in our view, essential to the practical
Java: Semantics and Type Soundness
"... Java is a programming language that has promised so much. Yet, those who are cautious are not very willing to use it for all sorts of programming applications. The main problem with Java is that it has borrowed so many features from so many languages and made itself very complicated in the process. ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Drossopoulou and Eisenbach have been heading the research group SLURP at Department of Computing, Imperial College for the past few years and they have been deeply involved in research on Java. So far, they have defined an operational semantics for the language, and this semantics also reasons about the type-checking
Read-Only Execution for Dynamic Languages ⋆
"... Abstract. Supporting read-only and side effect free execution has been the focus of a large body of work in the area of statically typed programming languages. Read-onlyness in dynamically typed languages is difficult to achieve because of the absence of a type checking phase and the support of an o ..."
Abstract
-
Cited by 22 (17 self)
- Add to MetaCart
Abstract. Supporting read-only and side effect free execution has been the focus of a large body of work in the area of statically typed programming languages. Read-onlyness in dynamically typed languages is difficult to achieve because of the absence of a type checking phase and the support
Composite Model Checking: Verification with Type-Specific Symbolic Representations
- ACM Transactions on Software Engineering and Methodology
, 2000
"... In recent years, there has been a surge of progress in automated verification methods based on state exploration. In areas like hardware design, these technologies are rapidly augmenting key phases of testing and validation. To date, one of the most successful of these methods has been symbolic mode ..."
Abstract
-
Cited by 30 (7 self)
- Add to MetaCart
In recent years, there has been a surge of progress in automated verification methods based on state exploration. In areas like hardware design, these technologies are rapidly augmenting key phases of testing and validation. To date, one of the most successful of these methods has been symbolic
Dynamic hot data stream prefetching for general-purpose programs
- InACM SIGPLANConference on Programming Language Designand Implementation
, 2002
"... Prefetching data ahead of use has the potential to tolerate the growing processor-memory performance gap by overlapping long latency memory accesses with useful computation. While sophisticated prefetching techniques have been automated for limited domains, such as scientific codes that access dense ..."
Abstract
-
Cited by 116 (2 self)
- Add to MetaCart
, is completely automatic, and works for generalpurpose programs, including pointer-chasing codes written in weakly-typed languages, such as C and C++. It operates in three phases. First, the profiling phase gathers a temporal data reference profile from a running program with low-overhead. Next, the profiling
Results 1 - 10
of
466
