Results 301 to 310 of about 101,913 (345)
Some of the next articles are maybe not open access.
B-ASM: Specification of ASM à la B
2010We aim at extending the B language in order to build ASM programs which are correct with respect to B-like logical specifications. On the one hand, the main strengths of the B formal method are: i) the ability to express logical statements, and ii) the construction of a correct implementation by refinement.
David Michel 0001 +2 more
openaire +1 more source
2010
This book introduces several key software specification methods. Each method is presented using the same example, an invoicing system, allowing the reader to compare and contrast. Every chapter follows a rigorous pattern whereby techniques and notations are gradually introduced through questions which are asked to an imaginary user.
Boerger, Egon +2 more
openaire +1 more source
This book introduces several key software specification methods. Each method is presented using the same example, an invoicing system, allowing the reader to compare and contrast. Every chapter follows a rigorous pattern whereby techniques and notations are gradually introduced through questions which are asked to an imaginary user.
Boerger, Egon +2 more
openaire +1 more source
Annual Meeting of the Association for Computational Linguistics
Vision-and-language navigation (VLN) is a key task in Embodied AI, requiring agents to navigate diverse and unseen environments while following natural language instructions.
Lingfeng Zhang +9 more
semanticscholar +1 more source
Vision-and-language navigation (VLN) is a key task in Embodied AI, requiring agents to navigate diverse and unseen environments while following natural language instructions.
Lingfeng Zhang +9 more
semanticscholar +1 more source
Mineral exhaustion, livelihoods and persistence of vulnerabilities in ASM settings
Journal of Rural Studies, 2022George Ofosu, David Sarpong
exaly
2003
A rich variety of system models for sequential, deterministic systems has been suggested during recent decades, including automata, process algebras, many versions of Petri Nets, and models to describe the semantics of Programming languages. All models for sequential, deterministic systems assume a set S of states, or configurations, and a next state ...
openaire +1 more source
A rich variety of system models for sequential, deterministic systems has been suggested during recent decades, including automata, process algebras, many versions of Petri Nets, and models to describe the semantics of Programming languages. All models for sequential, deterministic systems assume a set S of states, or configurations, and a next state ...
openaire +1 more source
Bull. EATCS, 1999
Summary: The thesis is that every sequential algorithm, on any level of abstraction, can be viewed as a sequential abstract state machine. Abstract State Machines (ASMs) used to be called evolving algebras. The sequential ASM thesis and its extensions inspired diverse applications of ASMs.
openaire +1 more source
Summary: The thesis is that every sequential algorithm, on any level of abstraction, can be viewed as a sequential abstract state machine. Abstract State Machines (ASMs) used to be called evolving algebras. The sequential ASM thesis and its extensions inspired diverse applications of ASMs.
openaire +1 more source