A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Filters
Testable use cases in the Abstract State Machine Language
Proceedings Second Asia-Pacific Conference on Quality Software
Preserved Fulltext
The Abstract State Machine Language (ASML) is an executable specification language developed at Microsoft Research. ...
In this paper we define an encoding of use cases in ASML and demonstrate the advantages by describing techniques to generate test cases and test oracles from the encoding. • The systems we observe are ...
An abstract state machine computes stepwise, simultaneous updates on these variables. ...
doi:10.1109/apaqs.2001.990016
dblp:conf/apaqs/GrieskampLST01
fatcat:xunhtvhqhvc75iisysn3jypohm
Page 3955 of Mathematical Reviews Vol. , Issue 92g
[page]
1992
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The main result is that a ma- chine has a strong observer in the traditional sense if and only if it has a strong observer which reasons about the machine us- ing a certain propositional language. ...
A locally testable language is a language with the property that, for some nonnegative integer k, whether or not a word w is in the language depends on (1) the prefix and suffix of w of length k, and ( ...
Towards testable communication software
[chapter]
1996
Protocol Test Systems VIII
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In the second part, we address one particular problem of DFT, the problem of analyzing the testability of a given module specified as a finite state machine. ...
Transformations in this paper are not the main objective, but they are used to illustrate how testability can be enhanced by finding an augmentation of the given protocol behavior such that a newly obtained ...
Acknowledgments This work was partly supported by the HP-NSERC-CITI Industrial Research Chair on Communication Protocols at Universite de Montreal, the NSERC Strategic and Individual Research Grant. ...
doi:10.1007/978-0-387-34988-6_15
fatcat:mq5gfl2l3rcurkg4geqyblansy
DESIGN AUTOMATION OF EASY-TESTED DIGITAL FINITE STATE MACHINES
2018
Radìoelektronika, Ìnformatika, Upravlìnnâ
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The task of computer-aided design of testable control finite state machine on the basis of application of FSM' setting methods into given state is solved in the work. ...
of finite state machine into an arbitrary state without the use of synchronizing sequences. ...
Hardware costs in this case increase by 20-25%, depending on the type of machine. ...
doi:10.15588/1607-3274-2018-2-13
fatcat:rkwfygbdz5ezdd42uhsp6eecje
Passive mid-stream monitoring of real-time properties
2005
Proceedings of the 5th ACM international conference on Embedded software - EMSOFT '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
are obtained mid-stream, from an unknown state in the middle of the execution of the system. ...
Passive monitoring or testing of complex systems and networks running in the field can provide valuable insights into their behavior in actual environments of use. ...
To distinguish between the two, we use the term timed state machines to refer to the formalism used for modeling system implementations and timed automata for expressing trace languages. ...
doi:10.1145/1086228.1086291
dblp:conf/emsoft/JagadeesanV05
fatcat:woyddfjuxzepjc267emu7nszlm
CommAI: Evaluating the first steps towards a useful general AI
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We believe this to be largely due to the lack of objective ways to measure progress towards broad machine intelligence. ...
In order to fill this gap, we propose here a set of concrete desiderata for general AI, together with a platform to test machines on how well they satisfy such desiderata, while keeping all further complexities ...
DESIDERATA FOR THE EVALUATION OF MACHINE INTELLIGENCE Rather than trying to define intelligence in abstract terms, we take a pragmatic approach: we would like to develop AIs that are useful for us. ...
arXiv:1701.08954v2
fatcat:uhtiqlq3mnb3vhpfwtpgca2nzy
Songs to syntax: the linguistics of birdsong
2011
Trends in Cognitive Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Whereas human language sound structure also appears to be describable via finite-state machines, comparable results are lacking in the case of human language, although certain parts of human language sound ...
The ordering uses the notion of descriptive complexity, corresponding informally to how much local context and internal state information must be used by a finite-state machine to recognize a particular ...
doi:10.1016/j.tics.2011.01.002
pmid:21296608
fatcat:6opgzuyonfaqnj3vg5mqunhti4
Testability of software components
1991
IEEE Transactions on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the Appendix, domain testability is defined in terms of denotational semantics. AUTHOR Roy S. Freedman Formerly with ...
Observability and controllability properties are already used for assessing the testability of hardware components. ...
Programs with input-output inconsistencies are not easily testable. In some sense, input-output inconsistencies are a consequence of using von Neumann programming languages [1] . ...
doi:10.1109/32.87281
fatcat:wlqd3fbtanfgffoajpoq3uhe4y
Notes on Formal Constructivism
2002
Humanistic Mathematics Network Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Our aim is to sketch some ideas related to how we (as in, we two) think we (as in, we humans) think. "That theory is useless. It isn't even wrong." -Wolfgang Pauli. ...
In this case the validity of the test would, of course, only be relative to the axioms assumed. For example, "The person reading this sentence is a human being," is both testable and probably true! ...
This capability of the brain might be regarded as an "abstraction device": a machine which is capable of noticing patterns from sequences of inputs. ...
doi:10.5642/hmnj.200201.26.09
fatcat:nasnrjzt7bcw3lecbpfaibjdri
Protocol testing
1994
Proceedings of the 1994 international symposium on Software testing and analysis - ISSTA '94
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These issues have a strong impact on testability. Finally, we review the practice of protocol conformance testing and state our conclusions. 1.1. ...
We review the major results in the area of protocol testing and discuss in which way these methods may also be relevant in the more general context of software testing. servation and synchronization problems ...
Acknowledgments: This research was supported by the IDACOM-NSERC-CWARC Industrial Research Chair on Communication Protocols at the University of Montreal. The authors wish to ...
doi:10.1145/186258.187153
dblp:conf/issta/BochmannP94
fatcat:cidcy7q36nfhte7sthilvgbw3y
A Default-Oriented Theory of Procedural Semantics
1989
Cognitive Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
For a machine to possess (or tacitly know) the semantics of its machine language in the sense required by PS, is just for the machine to stand in the right causal relationship to that machine language. ...
Fodor's Second Claim Fodor's case does not rest entirely upon his claims about machine language. ...
doi:10.1207/s15516709cog1301_4
fatcat:t622e2724zddhjkktlj4tx3ifq
A default-oriented theory of procedural semantics
1989
Cognitive Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
For a machine to possess (or tacitly know) the semantics of its machine language in the sense required by PS, is just for the machine to stand in the right causal relationship to that machine language. ...
Fodor's Second Claim Fodor's case does not rest entirely upon his claims about machine language. ...
doi:10.1016/0364-0213(89)90013-x
fatcat:xxvbtwobrjc7xi4pv3utuyfcqi
FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES
2012
International Journal of Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Local languages are characterized by the value k = 2 of the sliding window width in the McNaughton and Papert's infinite hierarchy of strictly locally testable languages (k-slt). ...
. * Extended Abstract. ...
can be used instead of a general finite state machine. ...
doi:10.1142/s0129054112400710
fatcat:wtc7q7hpj5aoxjfqqyeu6sacpy
Open Problems in Testability Transformation
2008
2008 IEEE International Conference on Software Testing Verification and Validation Workshop
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Testability transformation (tetra) seeks to transform a program in order to make it easier to generate test data. ...
The aim is to show how testability transformation can be applied to a wide range of testing scenarios. ...
[33] , who suggested the possibility of improving test data generation techniques for Finite State Machines using a testability transformation approach. ...
doi:10.1109/icstw.2008.30
dblp:conf/icst/Harman08
fatcat:jvno2zuhtfbdlcmq764r63l66a
Using C language extensions for developing embedded software: a case study
2015
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We report on an industrial case study on developing the embedded software for a smart meter using the C programming language and domain-specific extensions of C such as components, physical units, state ...
Our case study relies on mbeddr, an extensible version of C. mbeddr, in turn, builds on the MPS language workbench which supports modular extension of languages and IDEs. ...
Al-Wakeel of the King Saud University as well as Abdelghani El-Kacimi of itemis France for their advice and the permission to write about the smart meter projet. ...
doi:10.1145/2814270.2814276
dblp:conf/oopsla/VoelterDKE15
fatcat:womw253xlfa4jkepli5oypr4he
« Previous
Showing results 1 — 15 out of 8,496 results