Filters








119,276 Hits in 4.2 sec

Adaptable Processes (Extended Abstract) [chapter]

Mario Bravetti, Cinzia Di Giusto, Jorge A. Pérez, Gianluigi Zavattaro
2011 Lecture Notes in Computer Science  
Given a[P ], we often refer to P as the process residing at a.  ...  When the simulation performs a jump, the tested register is reset: if it was not empty (i.e., an erroneous test) then some resources are permanently lost.  ... 
doi:10.1007/978-3-642-21461-5_6 fatcat:rmuiuyb5vrdlbodnkaztz3x6dm

Efficient temporal reasoning (extended abstract)

E. A. Emerson, T. Sadler, J. Srinivasan
1989 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89  
There has been much interest in decision procedures for testing satisfiability ( or validity) of formulae in various systems of Temporal Logic.  ...  Consider any infinite path p in the extended tableau T:[.  ...  path along which the eventuality AF V is pending forever because every infinite path in it goes through V infinitely often.  ... 
doi:10.1145/75277.75292 dblp:conf/popl/EmersonSS89 fatcat:lx2gf47mcbhhvht6m2bhor2uoq

Modalities for model checking (extended abstract)

E. Allen Emerson, Chin-Laung Lei
1985 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '85  
fair iff every process enabled infinitely often is executed infinitely often.  ...  t in M of s also appears infinitely often along s.  ... 
doi:10.1145/318593.318620 dblp:conf/popl/EmersonL85 fatcat:x6kty74qarhxfhzekz7ey5ypvi

Abstract interpretation of algebraic polynomial systems (Extended abstract) [chapter]

Patrick Cousot, Radhia Cousot
1997 Lecture Notes in Computer Science  
We define a hierarchy of compositional formal semantics of algebraic polynomial systems over ~'-algebras by abstract interpretation.  ...  This generalizes classical formal language theoretical results and contextfree grammar flow-analysis algorithms in the same uniform framework of universal algebra and abstract interpretation.  ...  where the test (b ?  ... 
doi:10.1007/bfb0000468 fatcat:2ig2zujbebd4ph4mj7nh2wm6ze

Liveness of Communicating Transactions (Extended Abstract) [chapter]

Edsko de Vries, Vasileios Koutavas, Matthew Hennessy
2010 Lecture Notes in Computer Science  
We show that fair-testing and may-testing capture the right notions of liveness and safety in this setting, and argue that must-testing imposes too strong a requirement in the presence of transactions.  ...  We study liveness and safety in the context of CCS extended with communicating transactions, a construct we recently proposed to model automatic error recovery in distributed systems.  ...  A restarting transaction can however be aborted by the runtime system infinitely often, even though at every point in the computation the transaction can follow a path to a commit.  ... 
doi:10.1007/978-3-642-17164-2_27 fatcat:mdy3dnok3zbbpjwy5y4ix6etc4

Simplifying Casts and Coercions (Extended Abstract)

Robert Y. Lewis, Paul-Nicolas Madelaine
2020 Conference on Automated Deduction  
We thank Jasmin Blanchette for helpful comments, Gabriel Ebner for contributions to the code, and the mathlib community for extensive stress-testing.  ...  In the following library lemma about the extended nonnegative reals ennreal, lifting two ennreals to the type of nonnegative reals is justified by hypotheses that they are not infinite.  ...  The same is true in Lean, and one benefit of norm_cast is that it works even in the absence of definitional equalities, as is often the case with abstract algebraic structures.  ... 
dblp:conf/cade/LewisM20 fatcat:jq4fm6xplfd2rmyy7rzekd2ype

Process Behaviour: Formulae vs. Tests (Extended Abstract)

Andrea Cerone, Matthew Hennessy
2010 Electronic Proceedings in Theoretical Computer Science  
Process behaviour is often defined either in terms of the tests they satisfy, or in terms of the logical properties they enjoy.  ...  We first characterise subsets of this property logic which can be captured by tests. Then we show that those subsets of the property logic capture precisely the power of tests.  ...  s has an infinite path.  ... 
doi:10.4204/eptcs.41.3 fatcat:txsrzb2zoree5lbpjiyx4okq3m

Structured Production System (extended abstract) [article]

Yi Zhou
2017 arXiv   pre-print
In this extended abstract, we propose Structured Production Systems (SPS), which extend traditional production systems with well-formed syntactic structures.  ...  Finally, Section 7 discusses related issues and concludes this extended abstract.  ...  In this extended abstract, we showed that these issues can be addressed by introducing well-formed syntactic structures.  ... 
arXiv:1704.07950v1 fatcat:ne2grjwllndttoo33fisoloh7i

Security Abstractions and Intruder Models (Extended Abstract)

Michele Bugliesi, Riccardo Focardi
2009 Electronical Notes in Theoretical Computer Science  
Process algebraic specifications of distributed systems are increasingly being targeted at identifying security primitives well-suited as high-level programming abstractions, and at the same time adequate  ...  Drawing on our earlier work along these lines [5], we investigate the expressive power of a core set of security and network abstractions that provide high-level primitives for the specifications of the  ...  We then extend our network abstractions with a new primitive that enables the intruder to silently eavesdrop on network traffic (without necessarily intercepting it).  ... 
doi:10.1016/j.entcs.2009.06.015 fatcat:7he3rl2xbngvbjuvycntqi3aqi

OptStream: Releasing Time Series Privately (Extended Abstract)

Ferdinando Fioretto, Pascal Van Hentenryck
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
OptStream is evaluated on a test case involving the release of a real data stream from the largest European transmission operator.  ...  We monitor the accuracy of both the original and the exception targets during training and compare how often a model correctly memorises the exception target and how often it overgeneralises to the compositional  ...  Firstly, we analyse the case in which synonymous words occur equally often and in comparable contexts.  ... 
doi:10.24963/ijcai.2020/708 dblp:conf/ijcai/HupkesDMB20 fatcat:emiordmexrge7jkdxqigswxna4

Symbolic mathematics system evaluators (extended abstract)

Richard J. Fateman
1996 Proceedings of the 1996 international symposium on Symbolic and algebraic computation - ISSAC '96  
This provides infinite evaluation as done at the top level.  ...  Infinite evaluation can work only if eval(eval(x)) = eval(x).  ...  We could defer the testing until such time as it could be determined to be true or false (the example below is somewhat hacked together to simplify the concept of scope here): x:=3; r:= if (x>y) then g  ... 
doi:10.1145/236869.236907 dblp:conf/issac/Fateman96 fatcat:bzwdnup5ifh6jjgzcfpsyffy5y

Testing in the Distributed Test Architecture: An Extended Abstract

Robert M. Hierons
2008 2008 The Eighth International Conference on Quality Software  
In addition, traditionally only deterministic systems and models have been considered despite distributed systems often being non-deterministic.  ...  testing from a non-deterministic finite state machine and testing from an input output transition system.  ...  There is the challenge of extending this to NFSMs and IOTSs.  ... 
doi:10.1109/qsic.2008.11 dblp:conf/qsic/Hierons08 fatcat:zub7vkvshjdknh2obetxzfracq

Semantic Essence of AsmL: Extended Abstract [chapter]

Yuri Gurevich, Benjamin Rossman, Wolfram Schulte
2004 Lecture Notes in Computer Science  
The Abstract State Machine Language, AsmL, is a novel executable specification language based on the theory of Abstract State Machines.  ...  Maps are often used in forall and choose expressions (see Sections 2.5 and 2.7).  ...  A map can be overridden, extended or reduced (by removing some of its maplets). AsmL-S supports the usual object-oriented expressions for type testing and type casting.  ... 
doi:10.1007/978-3-540-30101-1_11 fatcat:u2yioofwxnfgjiu5uqaxql566e

Real-Reward Testing for Probabilistic Processes (Extended Abstract)

Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan
2011 Electronic Proceedings in Theoretical Computer Science  
We introduce a notion of real-valued reward testing for probabilistic processes by extending the traditional nonnegative-reward testing with negative rewards.  ...  In this richer testing framework, the may and must preorders turn out to be inverses.  ...  Conclusion We have studied a notion of real-reward testing which extends the traditional nonnegative-reward testing with negative rewards.  ... 
doi:10.4204/eptcs.57.5 fatcat:qtvju32mybasbfhfu5dxsedzp4

Compositionality Decomposed: How do Neural Networks Generalise? (Extended Abstract)

Dieuwke Hupkes, Verna Dankers, Mathijs Mul, Elia Bruni
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
To demonstrate the usefulness of this evaluation paradigm, we instantiate these five tests on a highly compositional data set which we dub PCFG SET, apply the resulting tests to three popular sequence-to-sequence  ...  We collect different interpretations of compositionality and translate them into five theoretically grounded tests for models that are formulated on a task-independent level.  ...  In this work [Amirian and Shiry Ghidary, 2019], we first illustrate some types of these symmetries by introducing order of aggregation and showing that CPA is able to * This paper is an extended abstract  ... 
doi:10.24963/ijcai.2020/697 dblp:conf/ijcai/AmirianG20 fatcat:gbia5t5mnvf6pdixzugvdf6g2e
« Previous Showing results 1 — 15 out of 119,276 results