• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 638
Next 10 →

On the Completeness of the Inductive Assertion Method*

by J. W. De B~mker, L. G. L. T. Meertens , 1974
"... Manna's theorem on (partial) correctness of programs essentially states that in the statement of the Floyd inductive assertion method, "A flow diagram is correct with respect o given initial and final assertions if suitable intermediate assertions can be found, " we may replace " ..."
Abstract - Add to MetaCart
Manna's theorem on (partial) correctness of programs essentially states that in the statement of the Floyd inductive assertion method, "A flow diagram is correct with respect o given initial and final assertions if suitable intermediate assertions can be found, " we may replace "

The strengthening the reporting of observational studies in epidemiology (STROBE) statement: guidelines for reporting observational studies.

by Erik Von Elm , Douglas G Altman , Matthias Egger , Stuart J Pocock , Peter C Gøtzsche , Jan P Vandenbroucke - PLoS Med , 2007
"... A B S T R A C T Much biomedical research is observational. The reporting of such research is often inadequate, which hampers the assessment of its strengths and weaknesses and of a study's generalisability. The Strengthening the Reporting of Observational Studies in Epidemiology (STROBE) Initi ..."
Abstract - Cited by 207 (1 self) - Add to MetaCart
. The workshop and the subsequent iterative process of consultation and revision resulted in a checklist of 22 items (the STROBE Statement) that relate to the title, abstract, introduction, methods, results, and discussion sections of articles. 18 items are common to all three study designs and four are specific

Inductive assertions and operational semantics

by J Strother Moore - CHARME 2003. Volume 2860 of LNCS., Springer-Verlag , 2003
"... Abstract. This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes only the proof obligations that would be produced by a verification condition generator but does not require th ..."
Abstract - Cited by 29 (8 self) - Add to MetaCart
Abstract. This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes only the proof obligations that would be produced by a verification condition generator but does not require

Self-determination and persistence in a real-life setting: Toward a motivational model of high school dropout.

by Robert J Vallerand , Michelle S Fbrtier , Frederic Guay - Journal of Personality and Social Psychology, , 1997
"... The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive the so ..."
Abstract - Cited by 183 (19 self) - Add to MetaCart
of high school. However, the Vallerand and Bissonnette study did not provide a complete assessment of the motivational model and did not deal with dropping out from high school as such. The purpose of the present study, therefore, was to provide a more thorough test of the motivational model of high

HEURISTIC METHODS FOR MECHANICALLY DERIVING INDUCTIVE ASSERTIONS

by Ben Hegbreitt
"... Current methods for mechanical program verification require a complete predicate specification on each loop. Because this is tedious and error-prone, producing a program with complete, correct predicates is reasonably difficult and would be facilitated by machine assistance. This paper discusses heu ..."
Abstract - Add to MetaCart
Current methods for mechanical program verification require a complete predicate specification on each loop. Because this is tedious and error-prone, producing a program with complete, correct predicates is reasonably difficult and would be facilitated by machine assistance. This paper discusses

Whom You Know Matters: Venture Capital Networks and Investment Performance,

by Yael Hochberg , Alexander Ljungqvist , Yang Lu , Steve Drucker , Jan Eberly , Eric Green , Yaniv Grinstein , Josh Lerner , Laura Lindsey , Max Maksimovic , Roni Michaely , Maureen O'hara , Ludo Phalippou Mitch Petersen , Jesper Sorensen , Per Strömberg Morten Sorensen , Yael Hochberg , Johnson - Journal of Finance , 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm's-length, spot-market transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract - Cited by 138 (8 self) - Add to MetaCart
of information, contacts, and resources among VCs (Bygrave (1988)), for instance by expanding the range of strategic alliance partners and launch customers for their portfolio companies. No less importantly, strong relationships with other VCs likely improve the chances of securing follow-on VC funding

Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks

by Stijn De Gouw, Frank De Boer, Wolfgang Ahrendt, Richard Bubel
"... Abstract. We present a completeness proof of the inductive assertion method for object-oriented programs extended with auxiliary variables. The class of programs considered are assumed to compute over structures which include the standard interpretation of Presburger arithmetic. Fur-ther, the assert ..."
Abstract - Add to MetaCart
Abstract. We present a completeness proof of the inductive assertion method for object-oriented programs extended with auxiliary variables. The class of programs considered are assumed to compute over structures which include the standard interpretation of Presburger arithmetic. Fur

ARE COMPLETE INTERSECTIONS COMPLETE

by Raymond C. Heitmann, David, A. Jorgensen
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

COMPLETENESS WI TH FINITE SYSTEMS OF INTERMEDIATE ASSERTIONS FOR RECURSIVE PROGRAM SCHEMES*

by Krzysztof R. Apt T
"... Abstract. I t is proved that in the general case of arbitrary context-free schemes a program is (partially) correct with respect to given initial and final assertions if and only if a suitable finite system of intermediate assertions can be found. Assertions are allowed from the extended state space ..."
Abstract - Add to MetaCart
and Meertens proved in [2] that an infinite system of intermediate assertions is needed to prove the completeness of the inductive assertion method in the case o f an arbitrary system of (mutually) recursive parameterless procedures. On the other hand, Gorelick in [5] extended the results of [3] and obtained a

Party over Policy: The Dominating Impact of Group Influence

by Geoffrey L Cohen - on Political Beliefs.’’ Journal of Personality and Social Psychology , 2003
"... Four studies demonstrated both the power of group influence in persuasion and people's blindness to it. Even under conditions of effortful processing, attitudes toward a social policy depended almost exclusively upon the stated position of one's political party. This effect overwhelmed th ..."
Abstract - Cited by 86 (7 self) - Add to MetaCart
group information: Democrats favor or Republicans favor) betweensubjects design. Method Participants All but 12 participants were recruited by telephone from a list of students enrolled in an introductory psychology course; they received course credit 809 GROUP INFLUENCE AND POLITICAL BELIEFS
Next 10 →
Results 1 - 10 of 638
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University