Runtime verification is a special form of runtime testing, employing formal methods and languages. In this work, we utilize next-time free linear-time temporal logic (LTL\X) as formal framework. The discipline serves ...
详细信息
ISBN:
(纸本)1581138334
Runtime verification is a special form of runtime testing, employing formal methods and languages. In this work, we utilize next-time free linear-time temporal logic (LTL\X) as formal framework. The discipline serves the purpose of asserting certain design-time assumptions about object-oriented (OO) entities such as objects, methods, and so forth. In this paper we propose a linear-time logic over join-points [4], and introduce a lightweight runtime verification tool based on this logic, J2SE 5 metadata [3] and an AspectJ-based [2] runtime backend. Implementations have been proposed so far for imperative and functional languages [5]. To our knowledge our approach is the first to allow addressing of entire sets of states, also over subclass boundaries, thus exploiting the OO nature.
This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers. It is based on combinator-like graph reduction: the user defined func...
详细信息
This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers. It is based on combinator-like graph reduction: the user defined functions are used as rewrite rules in the graph. Each function is compiled into an instruction sequence for an abstract graph reduction machine, called the G-machine, the code reduces a function application graph to its value. The G-machine instructions are then translated into target code. Speed improvements by almost two orders of magnitude over previous lazy evaluators have been measured;we provide some performance figures.
We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for all environments - i.e., regardless of the number and timing of crashes. The problems that w...
详细信息
ISBN:
(纸本)9781581138023
We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for all environments - i.e., regardless of the number and timing of crashes. The problems that we consider are: implementing an atomic register, solving consensus, solving quittable consensus (a variant of consensus in which processes have the option to decide 'quit' if a failure occurs), and solving non-blocking atomic commit.
The contribution of this paper is fourfold. First, we sketch an architecture of agent-enabled business process management that cleanly separates between agent capabilities, business process modeling, and the modeling ...
详细信息
We describe a method to automatically discover translation collocations from a bilingual corpus and how these improve a machine translation system. The process of inference of collocations is iterative: An alignment i...
详细信息
ISBN:
(纸本)9781586034528
We describe a method to automatically discover translation collocations from a bilingual corpus and how these improve a machine translation system. The process of inference of collocations is iterative: An alignment is used to derive an initial set of collocations, these are used in turn to improve the alignment and this new alignment is used to generate new collocations. This process is repeated until no more collocations are found. The final alignment and the set of collocations are used to train a translation model. We use a model that is based on finite state transducers and word clusters and has been modified to work with collocations in addition to single words. We present experiments in which we show that automatic collocations improve translation quality without prior linguistic information.
作者：
NANCY MERRITTTERRY FAINSUSAN TURNERExtensive experience conducting justice system policy studies at the state and local level. As a Policy Analyst with the RAND Corporation and government agencies
she designed and directed studies focused on the development implementation and evaluation of sentencing policy as well as juvenile and adult correctional programs. Her current work focuses on the implementation and impact of mandatory sentencing laws cross-jurisdictional variations in their application and the effects of prosecutorial discretion. Additional areas of interest include the development implementation and evaluation of juvenile justice programming. Ms. Merritt received her M.S. from the Pennsylvania State University University Park and is a Ph.D. candidate with the Rutgers University School of Criminal Justice. M.A.
M.S. is a Senior project associate in the Behavioral Sciences Department at RAND Corporation. He has extensive research experience in criminal justice and substance abuse. He is expert in computer statistical techniques as well as in managing large datasets. He has conducted analysis for many RAND projects and is author or co-author of numerous publications both from RAND and in peer-reviewed journals. His research interests include alternatives to incarceration substance abuse and treatment racial disparities in prison admissions and research collaborations with state and local justice agencies. Professor in the Department of Criminology
Law and Society at the University of California's Irvine campus. She received her Ph.D. in Social Psychology from the University of North Carolina at Chapel Hill. She has led a variety of research projects including studies on racial disparity field experiments of private sector alternatives for serious juvenile offenders work release day fines and a 14–site evaluation of intensive supervision probation. Dr. Turner's areas of expertise include the design and implementation of randomized field experiments and research collaborations with state and local justice agencies. He
Research Summary: Oregon's Measure 11, a mandatory minimum sentencing policy passed in 1994, had fewer negative system impacts than had been anticipated by many state and local criminal justice administrators, due...
详细信息
Research Summary: Oregon's Measure 11, a mandatory minimum sentencing policy passed in 1994, had fewer negative system impacts than had been anticipated by many state and local criminal justice administrators, due largely to the fact that prosecutors exercised the discretion provided them under the law to selectively prosecute cases. Consequently, fewer Measure 11-eligible cases were sentenced under the relevant statues than before passage of the measure, and more were sentenced to lesser related offenses. At the same time, incarceration rates and sentence lengths increased for both Measure 11 and lesser related offenses. Trial rates increased for two years after Measure 11 took effect before reverting to previous levels. Policy Implications: The “unintended consequences” that Measure 11 produced should not have been unexpected. Our research indicates that the entire system will quickly adapt to mitigate the more draconian outcomes predicted by those who assume a simplistic implementation, which underscores the importance of understanding system dynamics and inter-relationships before implementing reform, as well as the pitfalls of designing legislation for either symbolic appeal or formal logic rather than for actual effect.
One of the most difficult tasks in the development of Processaware Information Systems (p-IS) is the design of the related workflow. Methods and tools to support this design process are an emerging trend in Business P...
详细信息
Rapid single flux quantum (RSFQ) logic is a digital circuit technology that in recent years has presented itself as an alternative to semiconductors in the application of ultra high speed, very low power applications....
详细信息
Rapid single flux quantum (RSFQ) logic is a digital circuit technology that in recent years has presented itself as an alternative to semiconductors in the application of ultra high speed, very low power applications. The optimal timing of digital circuits operating at hundreds of GHz is still a complex problem for both RSFQ and semiconductor technologies. The fact that most RSFQ gates require a clock signal to function makes this even more complex. Various RSFQ timing schemes have been adapted from semiconductor design methodologies, and some have been designed specifically for RSFQ. Currently, synchronous clocking schemes outperform other schemes, but with the scale of RSFQ circuits ever increasing, the proper use of timing schemes are becoming more crucial. This paper describes a new asynchronous self-timing scheme where the details of clock distribution and clocking are built into the logic gates. Tests were done on the newly developed asynchronous logic gates and an asynchronous full adder was implemented and tested
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, naïve compilation of such specifications leads to creation o...
详细信息
Using Genetic programming difficult optimization problems can be solved, even if the candidate solutions are complex objects. In such cases, it is a costly procedure to correct or replace the invalid individuals that ...
详细信息
暂无评论